{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T20:00:32Z","timestamp":1759694432985,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[[2004,6,13]]},"DOI":"10.1145\/1007568.1007577","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"47-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["BLAS"],"prefix":"10.1145","author":[{"given":"Yi","family":"Chen","sequence":"first","affiliation":[{"name":"University of Pennsylvania"}]},{"given":"Susan B.","family":"Davidson","sequence":"additional","affiliation":[{"name":"University of Pennsylvania and INRIA-FUTURS (France)"}]},{"given":"Yifeng","family":"Zheng","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of SODA","author":"Abiteboul S.","year":"2001","unstructured":"S. Abiteboul , H. Kaplan , and T. Milo . Compact labeling schemes for ancestor queries . In Proceedings of SODA , 2001 .]] S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In Proceedings of SODA, 2001.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879022"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of SODA","author":"Alstrup S.","year":"2002","unstructured":"S. Alstrup and T. Rauhe . Improved labeling scheme for ancestor queries . In Proceedings of SODA , 2002 .]] S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In Proceedings of SODA, 2002.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.878942"},{"key":"e_1_3_2_1_5_1","unstructured":"J. Bosak. Shakespeare. http:\/\/www.ibiblio.org\/xml\/examples\/shakespeare\/.]]  J. Bosak. Shakespeare. http:\/\/www.ibiblio.org\/xml\/examples\/shakespeare\/.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564727"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of VLDB","author":"Chen Y.","year":"2003","unstructured":"Y. Chen , S. Davidson , C. Hara , and Y. Zheng . RRXS: Redundancy reducing XML storage in relations . In Proceedings of VLDB , 2003 .]] Y. Chen, S. Davidson, C. Hara, and Y. Zheng. RRXS: Redundancy reducing XML storage in relations. In Proceedings of VLDB, 2003.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"WebDB","author":"Chen Y.","year":"2002","unstructured":"Y. Chen , S. B. Davidson , and Y. Zheng . Constraint Preserving XML Storage in Relations . In WebDB , 2002 .]] Y. Chen, S. B. Davidson, and Y. Zheng. Constraint Preserving XML Storage in Relations. In WebDB, 2002.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645340.757498"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287393"},{"key":"e_1_3_2_1_11_1","volume-title":"November","author":"Clark J.","year":"1999","unstructured":"J. Clark and S. DeRose . XML Path language (XPath) , November 1999 . http:\/\/www.w3.org\/TR\/xpath.]] J. Clark and S. DeRose. XML Path language (XPath), November 1999. http:\/\/www.w3.org\/TR\/xpath.]]"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of VLDB","author":"Cooper B.","year":"2001","unstructured":"B. Cooper , N. Sample , M. J. Franklin , G. R. Hjaltason , and M. Shadmon . A fast index for semistructured data . In Proceedings of VLDB , 2001 .]] B. Cooper, N. Sample, M. J. Franklin, G. R. Hjaltason, and M. Shadmon. A fast index for semistructured data. In Proceedings of VLDB, 2001.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872832"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304220"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802184"},{"key":"e_1_3_2_1_17_1","first-page":"27","volume-title":"Bulletin of the Technical Committee on Data Engineering","author":"Florescu D.","year":"1999","unstructured":"D. Florescu and D. Kossmann . Storing and querying XML data using an RDBMS . In Bulletin of the Technical Committee on Data Engineering , pages 27 -- 34 , September 1999 .]] D. Florescu and D. Kossmann. Storing and querying XML data using an RDBMS. In Bulletin of the Technical Committee on Data Engineering, pages 27--34, September 1999.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Protein Sequence Database","author":"Information Resource Georgetown Protein","year":"2001","unstructured":"Georgetown Protein Information Resource . Protein Sequence Database , 2001 . http:\/\/www.cs.washington.edu\/research\/xmldatasets\/.]] Georgetown Protein Information Resource. Protein Sequence Database, 2001. http:\/\/www.cs.washington.edu\/research\/xmldatasets\/.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564705"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of ICDE","author":"Jiang H.","year":"2003","unstructured":"H. Jiang , H. Lu , W. Wang , and B. C. Ooi . XR-Tree: Indexing XML Data for Efficient Structural Joins . In Proceedings of ICDE , 2003 .]] H. Jiang, H. Lu, W. Wang, and B. C. Ooi. XR-Tree: Indexing XML Data for Efficient Structural Joins. In Proceedings of ICDE, 2003.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564707"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of ICDE","author":"Kaushik R.","year":"2002","unstructured":"R. Kaushik , P. Shenoy , P. Bohannon , and E. Gudes . Exploiting local similarity for efficient indexing of paths in graph structured data . In Proceedings of ICDE , 2002 .]] R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proceedings of ICDE, 2002.]]"},{"key":"e_1_3_2_1_23_1","author":"Li Q.","year":"2001","unstructured":"Q. Li and B. Moon . Indexing and querying XML data for regular path expressions. In The VLDB Journal, pages 361--370 , 2001 .]] Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. In The VLDB Journal, pages 361--370, 2001.]]","journal-title":"In The VLDB Journal, pages 361--370"},{"key":"e_1_3_2_1_24_1","volume-title":"Indexing semistructured data. Technical report","author":"McHugh J.","year":"1998","unstructured":"J. McHugh , J. Widom , S. Abiteboul , Q. Luo , and A. Rajaraman . Indexing semistructured data. Technical report , Stanford University , 1998 .]] J. McHugh, J. Widom, S. Abiteboul, Q. Luo, and A. Rajaraman. Indexing semistructured data. Technical report, Stanford University, 1998.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656266"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872775"},{"key":"e_1_3_2_1_27_1","author":"Shanmugasundaram J.","year":"1999","unstructured":"J. Shanmugasundaram , K. Tufte , C. Zhang , G. He , D. J. DeWitt , and J. F. Naughton . Relational databases for querying XML documents: Limitations and opportunities. In The VLDB Journal, pages 302--314 , 1999 .]] J. Shanmugasundaram, K. Tufte, C. Zhang, G. He, D. J. DeWitt, and J. F. Naughton. Relational databases for querying XML documents: Limitations and opportunities. In The VLDB Journal, pages 302--314, 1999.]]","journal-title":"In The VLDB Journal, pages 302--314"},{"key":"e_1_3_2_1_28_1","unstructured":"J. Simon and M. Fernndez. Galax. http:\/\/db.bell-labs.com\/galax.]]  J. Simon and M. Fernndez. Galax. http:\/\/db.bell-labs.com\/galax.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260808"},{"key":"e_1_3_2_1_30_1","unstructured":"XMARK the XML-benchmark project April 2001. http:\/\/monetdb.cwi.nl\/xml\/index.html.]]  XMARK the XML-benchmark project April 2001. http:\/\/monetdb.cwi.nl\/xml\/index.html.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375722"}],"event":{"name":"SIGMOD\/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Paris France","acronym":"SIGMOD\/PODS04"},"container-title":["Proceedings of the 2004 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007577","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007568.1007577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007577"}},"subtitle":["an efficient XPath processing system"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":30,"alternative-id":["10.1145\/1007568.1007577","10.1145\/1007568"],"URL":"https:\/\/doi.org\/10.1145\/1007568.1007577","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}