{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:53Z","timestamp":1750307093512,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,29]]},"DOI":"10.1145\/2396761.2396806","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"335-344","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["G-SPARQL"],"prefix":"10.1145","author":[{"given":"Sherif","family":"Sakr","sequence":"first","affiliation":[{"name":"NICTA and University of New South Wales, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameh","family":"Elnikety","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxiong","family":"He","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516417"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2009","unstructured":"T. Cormen , R. Rivest , C. Leiserson , and C. Stein . Introduction to Algorithms . The MIT Press , third edition, 2009 . T. Cormen, R. Rivest, C. Leiserson, and C. Stein. Introduction to Algorithms. The MIT Press, third edition, 2009."},{"key":"e_1_3_2_1_3_1","volume-title":"VLDB","author":"Abadi D.","year":"2007","unstructured":"D. Abadi Scalable Semantic Web Data Management Using Vertical Partitioning . In VLDB , 2007 . D. Abadi et al. Scalable Semantic Web Data Management Using Vertical Partitioning. In VLDB, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0238-6"},{"key":"e_1_3_2_1_7_1","volume-title":"gStore: Answering SPARQL Queries via Subgraph Matching. PVLDB, 4(8)","author":"Zou L.","year":"2011","unstructured":"L. Zou gStore: Answering SPARQL Queries via Subgraph Matching. PVLDB, 4(8) , 2011 . L. Zou et al. gStore: Answering SPARQL Queries via Subgraph Matching. PVLDB, 4(8), 2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247642"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559982"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316713"},{"key":"e_1_3_2_1_12_1","volume-title":"RDF-3X: a RISC-style engine for RDF. PVLDB, 1(1)","author":"Neumann T.","year":"2008","unstructured":"T. Neumann and G. Weikum . RDF-3X: a RISC-style engine for RDF. PVLDB, 1(1) , 2008 . T. Neumann and G. Weikum. RDF-3X: a RISC-style engine for RDF. PVLDB, 1(1), 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_3_2_1_14_1","unstructured":"E. Prud'hommeaux and A. Seaborne. SPARQL Query Language for RDF W3C Recommendation.  E. Prud'hommeaux and A. Seaborne. SPARQL Query Language for RDF W3C Recommendation."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00887-0_11"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.129"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368955"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"P. Zhao and J. Han. On Graph Query Optimization in Large Networks. PVLDB 2010 3 1 10.14778\/1920841.1920887","DOI":"10.14778\/1920841.1920887"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2396806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:38Z","timestamp":1750239278000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396806"}},"subtitle":["a hybrid engine for querying large attributed graphs"],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":20,"alternative-id":["10.1145\/2396761.2396806","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2396806","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}