{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T03:36:02Z","timestamp":1774064162988,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376676","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"581-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Efficient algorithms for exact ranked twig-pattern matching over graphs"],"prefix":"10.1145","author":[{"given":"Gang","family":"Gou","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}]},{"given":"Rada","family":"Chirkova","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879013"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/6617.6621"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564727"},{"key":"e_1_3_2_1_6_1","volume-title":"SODA","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . SODA , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SODA, 2002."},{"key":"e_1_3_2_1_7_1","volume-title":"VLDB","author":"Cohen S.","year":"2003","unstructured":"S. Cohen , J. Mamou , Y. Kanza , and Y. Sagiv . XSEarch: A semantic search engine for XML . VLDB , 2003 . S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSEarch: A semantic search engine for XML. VLDB, 2003."},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms ( 2 nd edition). MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms (2nd edition). MIT Press, 2001.","edition":"2"},{"key":"e_1_3_2_1_9_1","unstructured":"B. Dawes and D. Abrahams. Boost C++ Libraries. http:\/\/www.boost.org\/.  B. Dawes and D. Abrahams. Boost C++ Libraries. http:\/\/www.boost.org\/."},{"key":"e_1_3_2_1_10_1","unstructured":"DBLP. DBLP bibliography. http:\/\/dblp.uni-trier.de\/xml\/.  DBLP. DBLP bibliography. http:\/\/dblp.uni-trier.de\/xml\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367929"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1060"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872762"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233333"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_17_1","volume-title":"VLDB","author":"Hristidis V.","year":"2002","unstructured":"V. Hristidis and Y. Papakonstantinou . DISCOVER: Keyword search in relational databases . VLDB , 2002 . V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. VLDB, 2002."},{"key":"e_1_3_2_1_18_1","volume-title":"VLDB","author":"Kacholia V.","year":"2005","unstructured":"V. Kacholia , S. Pandit , S. Chakrabarti , S. Sudarshan , R. Desai , and H. Karambelkar . Bidirectional expansion for keyword search on graph databases . VLDB , 2005 . V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. VLDB, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372057"},{"key":"e_1_3_2_1_20_1","unstructured":"Oracle. Oracle Berkeley DB Java Edition (Version 3.2.44). http:\/\/www.oracle.com\/technology\/products\/berkeley-db\/ je\/index.html.  Oracle. Oracle Berkeley DB Java Edition (Version 3.2.44). http:\/\/www.oracle.com\/technology\/products\/berkeley-db\/ je\/index.html."},{"key":"e_1_3_2_1_21_1","volume-title":"VLDB","author":"Qi Y.","year":"2007","unstructured":"Y. Qi , K. S. Candan , and M. L. Sapino . Sum-Max monotonic ranked joins for evaluating top-k twig queries on weighted data graphs . VLDB , 2007 . Y. Qi, K. S. Candan, and M. L. Sapino. Sum-Max monotonic ranked joins for evaluating top-k twig queries on weighted data graphs. VLDB, 2007."},{"key":"e_1_3_2_1_22_1","volume-title":"WG Workshop","author":"Reich G.","year":"1989","unstructured":"G. Reich and P. Widmayer . Beyond Steiner?s problem: A VLSI oriented generalization . WG Workshop , 1989 . G. Reich and P. Widmayer. Beyond Steiner?s problem: A VLSI oriented generalization. WG Workshop, 1989."},{"key":"e_1_3_2_1_23_1","unstructured":"W3C. XML path language (XPath) Version 1.0. http:\/\/www.w3.org\/TR\/xpath 1999.  W3C. XML path language (XPath) Version 1.0. http:\/\/www.w3.org\/TR\/xpath 1999."},{"key":"e_1_3_2_1_24_1","volume-title":"http:\/\/www.w3.org\/RDF\/","author":"C. Resource Description","year":"2004","unstructured":"W3 C. Resource Description framework (RDF). http:\/\/www.w3.org\/RDF\/ , 2004 . W3C. Resource Description framework (RDF). http:\/\/www.w3.org\/RDF\/, 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.53"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:01Z","timestamp":1750255081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":25,"alternative-id":["10.1145\/1376616.1376676","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376676","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}