{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:32:59Z","timestamp":1768105979822,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772335"],"award-info":[{"award-number":["61772335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020AAA0108500"],"award-info":[{"award-number":["2020AAA0108500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1145\/3472883.3486991","type":"proceedings-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T10:48:16Z","timestamp":1635331696000},"page":"503-517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast and Accurate Optimizer for Query Processing over Knowledge Graphs"],"prefix":"10.1145","author":[{"given":"Jingqi","family":"Wu","sequence":"first","affiliation":[{"name":"Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University, Shanghai Artificial Intelligence Laboratory"}]},{"given":"Rong","family":"Chen","sequence":"additional","affiliation":[{"name":"Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University, Shanghai Artificial Intelligence Laboratory"}]},{"given":"Yubin","family":"Xia","sequence":"additional","affiliation":[{"name":"Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University, Shanghai Artificial Intelligence Laboratory"}]}],"member":"320","published-online":{"date-parts":[[2021,11]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2013. SPARQL 1.1 Query Language. https:\/\/www.w3.org\/TR\/sparql11-query\/.  2013. SPARQL 1.1 Query Language. https:\/\/www.w3.org\/TR\/sparql11-query\/."},{"key":"e_1_3_2_2_2_1","unstructured":"2014. Resource Description Framework (RDF). https:\/\/www.w3.org\/RDF\/.  2014. Resource Description Framework (RDF). https:\/\/www.w3.org\/RDF\/."},{"key":"e_1_3_2_2_3_1","unstructured":"2021. DBpedia's SPARQL Benchmark. http:\/\/aksw.org\/Projects\/DBPSB.  2021. DBpedia's SPARQL Benchmark. http:\/\/aksw.org\/Projects\/DBPSB."},{"key":"e_1_3_2_2_4_1","unstructured":"2021. Neo4j Cypher Query Language. https:\/\/neo4j.com\/developer\/cypher-query-language\/.  2021. Neo4j Cypher Query Language. https:\/\/neo4j.com\/developer\/cypher-query-language\/."},{"key":"e_1_3_2_2_5_1","unstructured":"2021. SWAT Projects - the Lehigh University Benchmark (LUBM). http:\/\/swat.cse.lehigh.edu\/projects\/lubm\/.  2021. SWAT Projects - the Lehigh University Benchmark (LUBM). http:\/\/swat.cse.lehigh.edu\/projects\/lubm\/."},{"key":"e_1_3_2_2_6_1","unstructured":"2021. TigerGraph GSQL Query Language. htps:\/\/www.tigergraph.com\/gsql\/.  2021. TigerGraph GSQL Query Language. htps:\/\/www.tigergraph.com\/gsql\/."},{"key":"e_1_3_2_2_7_1","unstructured":"2021. Waterloo SPARQL Diversity Test Suite (WSDTS). https:\/\/dsg.uwaterloo.ca\/watdiv\/.  2021. Waterloo SPARQL Diversity Test Suite (WSDTS). https:\/\/dsg.uwaterloo.ca\/watdiv\/."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2720174"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00085"},{"key":"e_1_3_2_2_11_1","volume-title":"Distributed Evaluation of Subgraph Queries Using Worstcase Optimal Low Memory Dataflows. arXiv preprint arXiv:1802.03760","author":"Ammar Khaled","year":"2018","unstructured":"Khaled Ammar , Frank McSherry , Semih Salihoglu , and Manas Joglekar . 2018. Distributed Evaluation of Subgraph Queries Using Worstcase Optimal Low Memory Dataflows. arXiv preprint arXiv:1802.03760 ( 2018 ). Khaled Ammar, Frank McSherry, Semih Salihoglu, and Manas Joglekar. 2018. Distributed Evaluation of Subgraph Queries Using Worstcase Optimal Low Memory Dataflows. arXiv preprint arXiv:1802.03760 (2018)."},{"key":"e_1_3_2_2_12_1","volume-title":"Hendler","author":"Atre Medha","year":"2010","unstructured":"Medha Atre , Vineet Chaoji , Mohammed J. Zaki , and James A . Hendler . 2010 . Matrix \"Bit\" Loaded : A Scalable Lightweight Join Query Processor for RDF Data. In Proc. WWW. Medha Atre, Vineet Chaoji, Mohammed J. Zaki, and James A. Hendler. 2010. Matrix \"Bit\" Loaded: A Scalable Lightweight Join Query Processor for RDF Data. In Proc. WWW."},{"key":"e_1_3_2_2_13_1","volume-title":"Proc. Usenix ATC. 49--60","author":"Bronson Nathan","year":"2013","unstructured":"Nathan Bronson , Zach Amsden , George Cabrera , Prasad Chakka , Peter Dimov , Hui Ding , Jack Ferris , Anthony Giardullo , Sachin Kulkarni , Harry Li , Mark Marchukov , Dmitri Petrov , Lovro Puzar , Yee Jiun Song , and Venkat Venkataramani . 2013 . TAO: Facebook's Distributed Data Store for the Social Graph . In Proc. Usenix ATC. 49--60 . Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry Li, Mark Marchukov, Dmitri Petrov, Lovro Puzar, Yee Jiun Song, and Venkat Venkataramani. 2013. TAO: Facebook's Distributed Data Store for the Social Graph. In Proc. Usenix ATC. 49--60."},{"key":"e_1_3_2_2_14_1","first-page":"209","article-title":"KLEE","volume":"8","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar , Daniel Dunbar , Dawson R Engler , 2008 . KLEE : Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proc. OSDI , Vol. 8. 209 -- 224 . Cristian Cadar, Daniel Dunbar, Dawson R Engler, et al. 2008. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs. In Proc. OSDI, Vol. 8. 209--224.","journal-title":"In Proc. OSDI"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298591"},{"key":"e_1_3_2_2_16_1","volume-title":"Proc. ICDE. 193--204","author":"da Trindade J. F.","unstructured":"J. F. da Trindade , K. Karanasos , C. Curino , S. Madden , and J. Shun . 2020. Kaskade: Graph Views for Efficient Graph Analytics . In Proc. ICDE. 193--204 . J. F. da Trindade, K. Karanasos, C. Curino, S. Madden, and J. Shun. 2020. Kaskade: Graph Views for Efficient Graph Analytics. In Proc. ICDE. 193--204."},{"key":"e_1_3_2_2_17_1","volume-title":"Proc. EDBT. 439--450","author":"Gubichev Andrey","year":"2014","unstructured":"Andrey Gubichev and Thomas Neumann . 2014 . Exploiting the Query Structure for Efficient Join Ordering in SPARQL Queries . In Proc. EDBT. 439--450 . Andrey Gubichev and Thomas Neumann. 2014. Exploiting the Query Structure for Efficient Join Ordering in SPARQL Queries. In Proc. EDBT. 439--450."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610511"},{"key":"e_1_3_2_2_19_1","first-page":"12","article-title":"GraphDB","volume":"94","author":"G\u00fcting Ralf Hartmut","year":"1994","unstructured":"Ralf Hartmut G\u00fcting . 1994 . GraphDB : Modeling and Querying Graphs in Databases. In Proc. VLDB , Vol. 94. 12 -- 15 . Ralf Hartmut G\u00fcting. 1994. GraphDB: Modeling and Querying Graphs in Databases. In Proc. VLDB, Vol. 94. 12--15.","journal-title":"Modeling and Querying Graphs in Databases. In Proc. VLDB"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.298174"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11581116_25"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2014.43"},{"key":"e_1_3_2_2_23_1","volume-title":"Singh","author":"He Huahai","year":"2008","unstructured":"Huahai He and Ambuj K . Singh . 2008 . Graphs-at-a-Time: Query Language and Access Methods for Graph Databases. In Proc. SIGMOD. 405--418. Huahai He and Ambuj K. Singh. 2008. Graphs-at-a-Time: Query Language and Access Methods for Graph Databases. In Proc. SIGMOD. 405--418."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303962"},{"key":"e_1_3_2_2_25_1","volume-title":"Proc. SC.","author":"Kumar Pradeep","unstructured":"Pradeep Kumar and H. Howie Huang . 2016. G-Store: High-Performance Graph Store for Trillion-Edge Processing . In Proc. SC. Pradeep Kumar and H. Howie Huang. 2016. G-Store: High-Performance Graph Store for Trillion-Edge Processing. In Proc. SC."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994510"},{"key":"e_1_3_2_2_29_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_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376672"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453927"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723714"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754973"},{"key":"e_1_3_2_2_36_1","volume-title":"Proc. OSDI.","author":"Shi Jiaxin","year":"2016","unstructured":"Jiaxin Shi , Youyang Yao , Rong Chen , Haibo Chen , and Feifei Li . 2016 . Fast and Concurrent RDF Queries with RDMA-based Distributed Graph Exploration . In Proc. OSDI. Jiaxin Shi, Youyang Yao, Rong Chen, Haibo Chen, and Feifei Li. 2016. Fast and Concurrent RDF Queries with RDMA-based Distributed Graph Exploration. In Proc. OSDI."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723732"},{"key":"e_1_3_2_2_38_1","volume-title":"Proc. Usenix ATC.","author":"Wang Siyuan","year":"2018","unstructured":"Siyuan Wang , Chang Lou , Rong Chen , and Haibo Chen . 2018 . Fast and Concurrent RDF Queries using RDMA-assisted GPU Graph Exploration . In Proc. Usenix ATC. Siyuan Wang, Chang Lou, Rong Chen, and Haibo Chen. 2018. Fast and Concurrent RDF Queries using RDMA-assisted GPU Graph Exploration. In Proc. Usenix ATC."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3265723.3265729"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535570.2488333"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132777"}],"event":{"name":"SoCC '21: ACM Symposium on Cloud Computing","location":"Seattle WA USA","acronym":"SoCC '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the ACM Symposium on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472883.3486991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472883.3486991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:57Z","timestamp":1750191117000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472883.3486991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":41,"alternative-id":["10.1145\/3472883.3486991","10.1145\/3472883"],"URL":"https:\/\/doi.org\/10.1145\/3472883.3486991","relation":{},"subject":[],"published":{"date-parts":[[2021,11]]},"assertion":[{"value":"2021-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}