{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:23Z","timestamp":1750308623479,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T00:00:00Z","timestamp":1332720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["233599"],"award-info":[{"award-number":["233599"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["G049165"],"award-info":[{"award-number":["G049165"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,26]]},"DOI":"10.1145\/2274576.2274595","type":"proceedings-article","created":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T15:32:03Z","timestamp":1339774323000},"page":"169-181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["On the complexity of query answering over incomplete XML documents"],"prefix":"10.1145","author":[{"given":"Am\u00e9lie","family":"Gheerbrant","sequence":"first","affiliation":[{"name":"University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Morgan Kauffman","author":"Abiteboul S.","year":"1999","unstructured":"S. Abiteboul , P. Buneman , D. Suciu . Data on the Web: From Relations to Semistructured Data and XML . Morgan Kauffman , 1999 . S. Abiteboul, P. Buneman, D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kauffman, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275516"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(51)90007-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132869"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497507"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1941440"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346332"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1870103.1870107"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773179"},{"key":"e_1_3_2_1_12_1","volume-title":"Description Logics","author":"Calvanese D.","year":"1998","unstructured":"D. Calvanese , G. De Giacomo , M. Lenzerini . Semi-structured data with constraints and incomplete information . In Description Logics , 1998 . D. Calvanese, G. De Giacomo, M. Lenzerini. Semi-structured data with constraints and incomplete information. In Description Logics, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/9.3.295"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology: Text Algorithms. World Scientific","author":"Crochemore M.","year":"2002","unstructured":"M. Crochemore , W. Rytter . Jewels of Stringology: Text Algorithms. World Scientific 2002 . M. Crochemore, W. Rytter. Jewels of Stringology: Text Algorithms. World Scientific 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807112"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1131342.1131345"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/531700"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519103.1519115"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543644"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989294"},{"key":"e_1_3_2_1_23_1","volume-title":"Combinatorial ALgorithms on Words","author":"Pinter R.","year":"1985","unstructured":"R. Pinter . Efficient string matching with don't-care patterns . In Combinatorial ALgorithms on Words , NATO ASI Series , 1985 . R. Pinter. Efficient string matching with don't-care patterns. In Combinatorial ALgorithms on Words, NATO ASI Series, 1985."},{"key":"e_1_3_2_1_24_1","first-page":"55","volume-title":"H. Gallaire and J. Minker eds","author":"Reiter R.","year":"1978","unstructured":"R. Reiter . On closed world databases. In \"Logic and Databases \", H. Gallaire and J. Minker eds , Plenum Press , 1978 , pages 55 -- 76 . R. Reiter. On closed world databases. In \"Logic and Databases\", H. Gallaire and J. Minker eds, Plenum Press, 1978, pages 55--76."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.011"},{"issue":"5","key":"e_1_3_2_1_26_1","first-page":"833","article-title":"Evaluating linear XPath expressions by pattern-matching automata","volume":"16","author":"Silvasti P.","year":"2010","unstructured":"P. Silvasti , S. Sippu , E. Soisalon-Soininen . Evaluating linear XPath expressions by pattern-matching automata . J. UCS 16 ( 5 ): 833 -- 851 ( 2010 ). P. Silvasti, S. Sippu, E. Soisalon-Soininen. Evaluating linear XPath expressions by pattern-matching automata. J. UCS 16(5):833--851 (2010).","journal-title":"J. UCS"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"D. Suciu D. Olteanu C. Re C. Koch. Probabilistic Databases. Morgan & Claypool 2011.   D. Suciu D. Olteanu C. Re C. Koch. Probabilistic Databases . Morgan & Claypool 2011.","DOI":"10.1007\/978-3-031-01879-4"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1455"}],"event":{"name":"ICDT '12: 15th International Conference on Database Theory","acronym":"ICDT '12","location":"Berlin Germany"},"container-title":["Proceedings of the 15th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2274576.2274595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2274576.2274595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:44Z","timestamp":1750273664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2274576.2274595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,26]]},"references-count":28,"alternative-id":["10.1145\/2274576.2274595","10.1145\/2274576"],"URL":"https:\/\/doi.org\/10.1145\/2274576.2274595","relation":{},"subject":[],"published":{"date-parts":[[2012,3,26]]},"assertion":[{"value":"2012-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}