{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:58Z","timestamp":1775912998660,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research Foundation, Singapore","award":["Asian Institute of Digital Finance"],"award-info":[{"award-number":["Asian Institute of Digital Finance"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457290","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"1758-1770","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration"],"prefix":"10.1145","author":[{"given":"Shixuan","family":"Sun","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Yuhang","family":"Chen","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Bryan","family":"Hooi","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_2_2_1","volume-title":"Foundations of databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of databases . Vol. 8 . Addison-Wesley Reading . Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of databases. Vol. 8. Addison-Wesley Reading."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_2_4_1","first-page":"1","article-title":"A new approach to incremental cycle detection and related problems","volume":"12","author":"Bender Michael A","year":"2015","unstructured":"Michael A Bender , Jeremy T Fineman , Seth Gilbert , and Robert E Tarjan . 2015 . A new approach to incremental cycle detection and related problems . ACM Transactions on Algorithms (TALG) , Vol. 12 , 2 (2015), 1 -- 22 . Michael A Bender, Jeremy T Fineman, Seth Gilbert, and Robert E Tarjan. 2015. A new approach to incremental cycle detection and related problems. ACM Transactions on Algorithms (TALG), Vol. 12, 2 (2015), 1--22.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.153"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627951"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3198394.3198410"},{"key":"e_1_3_2_2_8_1","volume-title":"EDBT 2015--18th International Conference on Extending Database Technology, Proceedings .","author":"Chang Lijun","year":"2015","unstructured":"Lijun Chang , Xuemin Lin , Lu Qin , Jeffrey Xu Yu , and Jian Pei . 2015 . Efficiently computing top-k shortest path join . In EDBT 2015--18th International Conference on Extending Database Technology, Proceedings . Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Jian Pei. 2015. Efficiently computing top-k shortest path join. In EDBT 2015--18th International Conference on Extending Database Technology, Proceedings ."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_2_11_1","series-title":"SIAM Journal on computing","volume-title":"Finding the k shortest paths","author":"Eppstein David","year":"1998","unstructured":"David Eppstein . 1998. Finding the k shortest paths . SIAM Journal on computing , Vol. 28 , 2 ( 1998 ), 652--673. David Eppstein. 1998. Finding the k shortest paths. SIAM Journal on computing, Vol. 28, 2 (1998), 652--673."},{"key":"e_1_3_2_2_12_1","volume-title":"FATF Report: Money Laundering and Terrorist Financing Vulnerabilities of Legal Professionals","author":"Financial Action Task Force","year":"2013","unstructured":"Financial Action Task Force . 2013. FATF Report: Money Laundering and Terrorist Financing Vulnerabilities of Legal Professionals . Paris : FATF ( 2013 ). Financial Action Task Force. 2013. FATF Report: Money Laundering and Terrorist Financing Vulnerabilities of Legal Professionals. Paris: FATF (2013)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871504"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77404-6_40"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071382"},{"key":"e_1_3_2_2_16_1","volume-title":"17th International Conference on Conceptual Structures","volume":"46","author":"Jedrzejek Czeslaw","year":"2009","unstructured":"Czeslaw Jedrzejek , J Bak , and M Falkowski . 2009 . Graph mining for detection of a large class of financial crimes . In 17th International Conference on Conceptual Structures , Moscow, Russia , Vol. 46 . Czeslaw Jedrzejek, J Bak, and M Falkowski. 2009. Graph mining for detection of a large class of financial crimes. In 17th International Conference on Conceptual Structures, Moscow, Russia, Vol. 46."},{"key":"e_1_3_2_2_17_1","volume-title":"Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! arXiv preprint arXiv:1906.12018","author":"Jin Ruoming","year":"2019","unstructured":"Ruoming Jin , Zhen Peng , Wendell Wu , Feodor Dragan , Gagan Agrawal , and Bin Ren . 2019. Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! arXiv preprint arXiv:1906.12018 ( 2019 ). Ruoming Jin, Zhen Peng, Wendell Wu, Feodor Dragan, Gagan Agrawal, and Bin Ren. 2019. Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! arXiv preprint arXiv:1906.12018 (2019)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_2_20_1","volume-title":"Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong.","author":"Kim Kyoungmin","year":"2018","unstructured":"Kyoungmin Kim , In Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong. 2018 . Turboflux : A fast continuous subgraph matching system for streaming graph data. In Proceedings of the 2018 International Conference on Management of Data . 411--426. Kyoungmin Kim, In Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong. 2018. Turboflux: A fast continuous subgraph matching system for streaming graph data. In Proceedings of the 2018 International Conference on Management of Data. 411--426."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236197"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Xiangfeng Li Shenghua Liu Zifeng Li Xiaotian Han Chuan Shi Bryan Hooi He Huang and Xueqi Cheng. 2020. FlowScope: Spotting Money Laundering Based on Graphs.. In AAAI. 4731--4738.  Xiangfeng Li Shenghua Liu Zifeng Li Xiaotian Han Chuan Shi Bryan Hooi He Huang and Xueqi Cheng. 2020. FlowScope: Spotting Money Laundering Based on Graphs.. In AAAI. 4731--4738.","DOI":"10.1609\/aaai.v34i04.5906"},{"key":"e_1_3_2_2_25_1","first-page":"121","article-title":"A new implementation of Yen's ranking loopless paths algorithm","volume":"1","author":"Martins Ernesto QV","year":"2003","unstructured":"Ernesto QV Martins and Marta MB Pascoal . 2003 . A new implementation of Yen's ranking loopless paths algorithm . Quarterly Journal of the Belgian, French and Italian Operations Research Societies , Vol. 1 , 2 (2003), 121 -- 133 . Ernesto QV Martins and Marta MB Pascoal. 2003. A new implementation of Yen's ranking loopless paths algorithm. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, Vol. 1, 2 (2003), 121--133.","journal-title":"Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"key":"e_1_3_2_2_26_1","volume-title":"Optimizing subgraph queries by combining binary and worst-case optimal joins. arXiv preprint arXiv:1903.02076","author":"Mhedhbi Amine","year":"2019","unstructured":"Amine Mhedhbi and Semih Salihoglu . 2019. Optimizing subgraph queries by combining binary and worst-case optimal joins. arXiv preprint arXiv:1903.02076 ( 2019 ). Amine Mhedhbi and Semih Salihoglu. 2019. Optimizing subgraph queries by combining binary and worst-case optimal joins. arXiv preprint arXiv:1903.02076 (2019)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10697"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389702"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372720"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.253"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_3_2_2_33_1","volume-title":"International Workshop on Combinatorial Algorithms. Springer, 318--329","author":"Rizzi Romeo","year":"2014","unstructured":"Romeo Rizzi , Gustavo Sacomoto , and Marie-France Sagot . 2014 . Efficiently listing bounded length st-paths . In International Workshop on Combinatorial Algorithms. Springer, 318--329 . Romeo Rizzi, Gustavo Sacomoto, and Marie-France Sagot. 2014. Efficiently listing bounded length st-paths. In International Workshop on Combinatorial Algorithms. Springer, 318--329."},{"key":"e_1_3_2_2_34_1","volume-title":"Discriminative predicate path mining for fact checking in knowledge graphs. Knowledge-based systems","author":"Shi Baoxu","year":"2016","unstructured":"Baoxu Shi and Tim Weninger . 2016. Discriminative predicate path mining for fact checking in knowledge graphs. Knowledge-based systems , Vol. 104 ( 2016 ), 123--133. Baoxu Shi and Tim Weninger. 2016. Discriminative predicate path mining for fact checking in knowledge graphs. Knowledge-based systems, Vol. 104 (2016), 123--133."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.105"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.04.103"},{"key":"e_1_3_2_2_37_1","volume-title":"PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration (Complete Version). arXiv preprint arXiv:2103.11137","author":"Sun Shixuan","year":"2021","unstructured":"Shixuan Sun , Yuhang Chen , Bingsheng He , and Bryan Hooi . 2021. PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration (Complete Version). arXiv preprint arXiv:2103.11137 ( 2021 ). Shixuan Sun, Yuhang Chen, Bingsheng He, and Bryan Hooi. 2021. PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration (Complete Version). arXiv preprint arXiv:2103.11137 (2021)."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425888"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202017"},{"key":"e_1_3_2_2_41_1","volume-title":"Entity Context and Relational Paths for Knowledge Graph Completion. arXiv preprint arXiv:2002.06757","author":"Wang Hongwei","year":"2020","unstructured":"Hongwei Wang , Hongyu Ren , and Jure Leskovec . 2020. Entity Context and Relational Paths for Knowledge Graph Completion. arXiv preprint arXiv:2002.06757 ( 2020 ). Hongwei Wang, Hongyu Ren, and Jure Leskovec. 2020. Entity Context and Relational Paths for Knowledge Graph Completion. arXiv preprint arXiv:2002.06757 (2020)."},{"key":"e_1_3_2_2_42_1","unstructured":"Norihito Yasuda Teruji Sugaya and Shin-Ichi Minato. 2017. Fast compilation of st paths on a graph for counting and enumeration. In Advanced Methodologies for Bayesian Networks. 129--140.  Norihito Yasuda Teruji Sugaya and Shin-Ichi Minato. 2017. Fast compilation of st paths on a graph for counting and enumeration. In Advanced Methodologies for Bayesian Networks. 129--140."},{"key":"e_1_3_2_2_43_1","volume-title":"Finding the k shortest loopless paths in a network. management Science","author":"Yen Jin Y","year":"1971","unstructured":"Jin Y Yen . 1971. Finding the k shortest loopless paths in a network. management Science , Vol. 17 , 11 ( 1971 ), 712--716. Jin Y Yen. 1971. Finding the k shortest loopless paths in a network. management Science, Vol. 17, 11 (1971), 712--716."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":43,"alternative-id":["10.1145\/3448016.3457290","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457290","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}