{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:48Z","timestamp":1750308228593,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"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.1007624","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"491-502","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Incremental maintenance of XML structural indexes"],"prefix":"10.1145","author":[{"given":"Ke","family":"Yi","sequence":"first","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"He","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Stanoi","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson, Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[{"name":"Duke University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The Internet Movie Database. http:\/\/www.imdb.com.]]  The Internet Movie Database. http:\/\/www.imdb.com.]]"},{"key":"e_1_3_2_1_2_1","unstructured":"The XML benchmark project http:\/\/www.xml-benchmark.org.]]  The XML benchmark project http:\/\/www.xml-benchmark.org.]]"},{"key":"e_1_3_2_1_3_1","volume-title":"VLDB","author":"Aboulnaga A.","year":"2001","unstructured":"A. Aboulnaga , A. R. Alameldeen , and J. F. Naughton . Estimating the selectivity of XML path expressions for internet scale applications . In VLDB , 2001 .]] A. Aboulnaga, A. R. Alameldeen, and J. F. Naughton. Estimating the selectivity of XML path expressions for internet scale applications. In VLDB, 2001.]]"},{"key":"e_1_3_2_1_4_1","volume-title":"XML path language XPath http:\/\/www.w3.org\/TR\/xpath","author":"Clark J.","year":"1999","unstructured":"J. Clark and S. DeRose . XML path language XPath http:\/\/www.w3.org\/TR\/xpath . 1999 .]] J. Clark and S. DeRose. XML path language XPath http:\/\/www.w3.org\/TR\/xpath. 1999.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645483.653613"},{"key":"e_1_3_2_1_6_1","volume-title":"VLDB","author":"Goldman R.","year":"1997","unstructured":"R. Goldman and J. Widom . DataGuides: Enabling query formulation and optimization in semistructured databases . In VLDB , 1997 .]] R. Goldman and J. Widom. DataGuides: Enabling query formulation and optimization in semistructured databases. In VLDB, 1997.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978094"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287391"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879023"},{"key":"e_1_3_2_1_10_1","author":"McHugh J.","year":"1999","unstructured":"J. McHugh and J. Widom . Query optimization for XML. In The VLDB Journal, pages 315--326 , 1999 .]] J. McHugh and J. Widom. Query optimization for XML. In The VLDB Journal, pages 315--326, 1999.]]","journal-title":"Query optimization for XML. In The VLDB Journal, pages 315--326"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656266"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"e_1_3_2_1_13_1","first-page":"167","volume-title":"Theoretical Computer Science, 5th GI-Conf., LNCS 104","author":"Park D.","year":"1981","unstructured":"D. Park . Concurrency and automata on infinite sequences . In Theoretical Computer Science, 5th GI-Conf., LNCS 104 , pages 167 -- 183 , 1981 .]] D. Park. Concurrency and automata on infinite sequences. In Theoretical Computer Science, 5th GI-Conf., LNCS 104, pages 167--183, 1981.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646162.680357"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646713.703475"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564733"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872776"}],"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.1007624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007568.1007624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:32Z","timestamp":1750264292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":17,"alternative-id":["10.1145\/1007568.1007624","10.1145\/1007568"],"URL":"https:\/\/doi.org\/10.1145\/1007568.1007624","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"}}]}}