{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:35Z","timestamp":1750308755885,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1265530.1265552","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"155-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["The complexity of reasoning about pattern-based XML schemas"],"prefix":"10.1145","author":[{"given":"Gjergji","family":"Kasneci","sequence":"first","affiliation":[{"name":"Max-Planck-Institute for Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[{"name":"University of Dortmund"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/974750.974757"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1065167.1065171"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1060745.1060848"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1006\/inco.1997.2695"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/0022-0000(86)90036-X"},{"unstructured":"H. Comon M. Dauchet R. Gilleron F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree Automata Techniques and Applications. http:\/\/www.grappa.univ-lille3.fr\/tata 1997.  H. Comon M. Dauchet R. Gilleron F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree Automata Techniques and Applications. http:\/\/www.grappa.univ-lille3.fr\/tata 1997.","key":"e_1_3_2_1_7_1"},{"unstructured":"World Wide Web Consortium. Extensible Markup Language (XML). http:\/\/www.w3.org\/XML.  World Wide Web Consortium. Extensible Markup Language (XML). http:\/\/www.w3.org\/XML.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/11537311_7"},{"key":"e_1_3_2_1_10_1","first-page":"889","volume":"04","author":"Martens W.","year":"2004","unstructured":"W. Martens , F. Neven , and T. Schwentick . Complexity of Decision Problems for Simple Regular Expressions. MFCS 04 , pages 889 -- 900 , 2004 . W. Martens, F. Neven, and T. Schwentick. Complexity of Decision Problems for Simple Regular Expressions. MFCS 04, pages 889--900, 2004.","journal-title":"Complexity of Decision Problems for Simple Regular Expressions. MFCS"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/978-3-540-30570-5_5"},{"key":"e_1_3_2_1_12_1","first-page":"04","author":"Marx M.","year":"2004","unstructured":"M. Marx . X Path with conditional axis relations. In EDBT 04 , 2004 . M. Marx. XPath with conditional axis relations. In EDBT 04, 2004.","journal-title":"EDBT"},{"key":"e_1_3_2_1_13_1","volume-title":"Extreme Markup Languages","author":"Murata M.","year":"2001","unstructured":"M. Murata , D. Lee , and M. Mani . Taxonomy of XML Schema Languages using Formal Language Theory . Extreme Markup Languages , Montreal, Canada , 2001 . M. Murata, D. Lee, and M. Mani. Taxonomy of XML Schema Languages using Formal Language Theory. Extreme Markup Languages, Montreal, Canada, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/647852.737555"},{"key":"e_1_3_2_1_15_1","volume-title":"On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in COmputer Science, 2(3)","author":"Neven F.","year":"2006","unstructured":"F. Neven and T. Schwentick . On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in COmputer Science, 2(3) , 2006 . F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in COmputer Science, 2(3), 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1016\/j.jcss.2006.10.003"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"acronym":"SIGMOD\/PODS07","name":"SIGMOD\/PODS07: International Conference on Management of Data","location":"Beijing China"},"container-title":["Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1265530.1265552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1265530.1265552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:24Z","timestamp":1750278144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1265530.1265552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":15,"alternative-id":["10.1145\/1265530.1265552","10.1145\/1265530"],"URL":"https:\/\/doi.org\/10.1145\/1265530.1265552","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}