{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:23:52Z","timestamp":1752672232644,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Royal Society Wolfson Research Merit Award","award":["WRM\/R1\/180014"],"award-info":[{"award-number":["WRM\/R1\/180014"]}]},{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["652976"],"award-info":[{"award-number":["652976"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Institute of Computer Sciences"},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["RP\/M025268\/1"],"award-info":[{"award-number":["RP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Advanced Innovation Center for Big Data and Brain Computing"},{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602023"],"award-info":[{"award-number":["61602023"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3380585","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"715-729","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Extending Graph Patterns with Conditions"],"prefix":"10.1145","author":[{"given":"Grace","family":"Fan","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Wenfei","family":"Fan","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Beihang University & Shenzhen University, Edinburgh, United Kingdom"}]},{"given":"Yuanhao","family":"Li","sequence":"additional","affiliation":[{"name":"University of Edinburgh & Shenzhen University, Edinburgh, United Kingdom"}]},{"given":"Ping","family":"Lu","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}]},{"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"volume-title":"Foundations of Databases","author":"Abiteboul Serge","key":"e_1_3_2_2_1_1","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases .Addison-Wesley."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Fei Bi Lijun Chang Xuemin Lin Lu Qin and Wenjie Zhang. 2016. Efficient subgraph matching by postponing cartesian products. In SIGMOD.  Fei Bi Lijun Chang Xuemin Lin Lu Qin and Wenjie Zhang. 2016. Efficient subgraph matching by postponing cartesian products. In SIGMOD.","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_2_4_1","volume-title":"Continuous queries for multi-relational graphs. CoRR","author":"Choudhury Sutanay","year":"2012","unstructured":"Sutanay Choudhury , Lawrence B Holder , Abhik Ray , George Chin Jr , and John T Feo . 2012. Continuous queries for multi-relational graphs. CoRR , Vol. abs\/ 1209 .2178 ( 2012 ). Sutanay Choudhury,Lawrence B Holder, Abhik Ray,George Chin Jr, and John T Feo. 2012. Continuous queries for multi-relational graphs. CoRR, Vol. abs\/1209.2178 (2012)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_2_6_1","unstructured":"Wenfei Fan Chunming Hu and Chao Tian. 2017. Incremental graph computations: Doable and undoable. In SIGMOD.  Wenfei Fan Chunming Hu and Chao Tian. 2017. Incremental graph computations: Doable and undoable. In SIGMOD."},{"key":"e_1_3_2_2_7_1","unstructured":"Wenfei Fan Xueli Liu Ping Lu and Chao Tian. 2018. Catching Numeric Inconsistencies in Graphs. In SIGMOD.  Wenfei Fan Xueli Liu Ping Lu and Chao Tian. 2018. Catching Numeric Inconsistencies in Graphs. In SIGMOD."},{"key":"e_1_3_2_2_8_1","volume-title":"TODS","volume":"44","author":"Fan Wenfei","year":"2019","unstructured":"Wenfei Fan and Ping Lu . 2019 . Dependencies for Graphs . TODS , Vol. 44 , 2 (2019), 5:1--5:40. Wenfei Fan and Ping Lu. 2019. Dependencies for Graphs. TODS, Vol. 44, 2 (2019), 5:1--5:40."},{"key":"e_1_3_2_2_9_1","unstructured":"Wenfei Fan Yinghui Wu and Jingbo Xu. 2016. Functional dependencies for graphs. In SIGMOD.  Wenfei Fan Yinghui Wu and Jingbo Xu. 2016. Functional dependencies for graphs. In SIGMOD."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Sheldon Finkelstein. 1982. Common expression analysis in database applications. In SIGMOD.  Sheldon Finkelstein. 1982. Common expression analysis in database applications. In SIGMOD.","DOI":"10.1145\/582353.582400"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116878"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael","key":"e_1_3_2_2_12_1","unstructured":"Michael Garey and David Johnson . 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman and Company . Michael Garey and David Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman and Company."},{"volume-title":"The Problem of Incomplete Information inRelational Databases","author":"Grahne G\u00f6sta","key":"e_1_3_2_2_13_1","unstructured":"G\u00f6sta Grahne . 1991. The Problem of Incomplete Information inRelational Databases . Springer . G\u00f6sta Grahne. 1991. The Problem of Incomplete Information inRelational Databases. Springer."},{"key":"e_1_3_2_2_14_1","unstructured":"Wook-Shin Han JinsooLee and Jeong-Hoon Lee. 2013. Turbo iso: Towards ultrafast and robust subgraph isomorphism search in large graph databases. In SIGMOD.  Wook-Shin Han JinsooLee and Jeong-Hoon Lee. 2013. Turbo iso: Towards ultrafast and robust subgraph isomorphism search in large graph databases. In SIGMOD."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"volume-title":"Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries. Master's thesis","author":"Kankanamge Chathura","key":"e_1_3_2_2_17_1","unstructured":"Chathura Kankanamge . 2018. Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries. Master's thesis . University of Waterloo . Chathura Kankanamge. 2018. Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries. Master's thesis. University of Waterloo."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_2_2_19_1","volume-title":"SAMUEL: A Sharing-based Approach to processing Multiple SPARQL Queries with MapReduce. In EDBT.","author":"Kim Ina","year":"2018","unstructured":"Ina Kim , Kyong-Ha Lee ,and Kyu-Chul Lee . 2018 a. SAMUEL: A Sharing-based Approach to processing Multiple SPARQL Queries with MapReduce. In EDBT. Ina Kim, Kyong-Ha Lee,and Kyu-Chul Lee. 2018a. SAMUEL: A Sharing-based Approach to processing Multiple SPARQL Queries with MapReduce. In EDBT."},{"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 b. TurboFlux : A fast continuous subgraph matching system for streaming graph data. In SIGMOD. Kyoungmin Kim, In Seo,Wook-Shin Han, Jeong-Hoon Lee,Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong. 2018b. TurboFlux: A fast continuous subgraph matching system for streaming graph data. In SIGMOD."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/42267.42273"},{"key":"e_1_3_2_2_22_1","unstructured":"Wangchao Le Anastasios Kementsietsidis Songyun Duan and Feifei Li. 2012. Scalable Multi-query Optimization for SPARQL. In ICDE.  Wangchao Le Anastasios Kementsietsidis Songyun Duan and Feifei Li. 2012. Scalable Multi-query Optimization for SPARQL. In ICDE."},{"key":"e_1_3_2_2_23_1","volume-title":"andHan Wook-Shin","author":"Myoungji Han","year":"2019","unstructured":"Han Myoungji , KimHyunjoon, Gu Geonmo , Park Kunsoo , andHan Wook-Shin . 2019 . Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together. In SIGMOD. Han Myoungji, KimHyunjoon, Gu Geonmo, Park Kunsoo, andHan Wook-Shin. 2019. Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together. In SIGMOD."},{"key":"e_1_3_2_2_24_1","unstructured":"Jooseok Park and ArieSegev. 1988. Using common subexpressions to optimize multiplequeries. In ICDE.  Jooseok Park and ArieSegev. 1988. Using common subexpressions to optimize multiplequeries. In ICDE."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021929"},{"key":"e_1_3_2_2_27_1","volume-title":"Completeness in the polynomial-time hierarchy: Acompendium. SIGACT news","author":"Schaefer Marcus","year":"2002","unstructured":"Marcus Schaefer and Christopher Umans . 2002. Completeness in the polynomial-time hierarchy: Acompendium. SIGACT news , Vol. 33 , 3 ( 2002 ), 32--49. Marcus Schaefer and Christopher Umans. 2002. Completeness in the polynomial-time hierarchy: Acompendium. SIGACT news, Vol. 33, 3 (2002), 32--49."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_32_1","unstructured":"Wiki. 2019. Alibaba Group. sl https:\/\/en.wikipedia.org\/wiki\/Alibaba_Group.  Wiki. 2019. Alibaba Group. sl https:\/\/en.wikipedia.org\/wiki\/Alibaba_Group."},{"key":"e_1_3_2_2_33_1","volume-title":"Efficient Continuous Multi-Query Processing over Graph Streams. CoRR","author":"Zervakis Lefteris","year":"2019","unstructured":"Lefteris Zervakis , VinaySetty, Christos Tryfonopoulos , and Katja Hose . 2019. Efficient Continuous Multi-Query Processing over Graph Streams. CoRR , Vol. abs\/ 1902 .05134 ( 2019 ). Lefteris Zervakis, VinaySetty, Christos Tryfonopoulos, and Katja Hose. 2019. Efficient Continuous Multi-Query Processing over Graph Streams. CoRR, Vol. abs\/1902.05134 (2019)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Jingren Zhou Per-AkeLarson Johann-Christoph Freytag and Wolfgang Lehner. 2007. Efficient exploitation of similar subexpressions for query processing. In SIGMOD.  Jingren Zhou Per-AkeLarson Johann-Christoph Freytag and Wolfgang Lehner. 2007. Efficient exploitation of similar subexpressions for query processing. In SIGMOD.","DOI":"10.1145\/1247480.1247540"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3380585","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3380585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:52Z","timestamp":1750208512000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3380585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":35,"alternative-id":["10.1145\/3318464.3380585","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3380585","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}