{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T22:33:10Z","timestamp":1785796390539,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"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":[[2009,6,29]]},"DOI":"10.1145\/1559845.1559922","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"731-744","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Simplifying XML schema"],"prefix":"10.1145","author":[{"given":"Geert Jan","family":"Bex","sequence":"first","affiliation":[{"name":"Hasselt University and Transnational University of Limburg, Hasselt, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wouter","family":"Gelade","sequence":"additional","affiliation":[{"name":"Hasselt University and Transnational University of Limburg, Hasselt, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"Technical University of Dortmund, Dortmund, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[{"name":"Hasselt University and Transnational University of Limburg, Hasselt, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"27","volume-title":"Workshop on Principles of Document Processing (PODP)","author":"Ahonen H.","year":"1996","unstructured":"H. Ahonen . Disambiguation of SGML content models . In Workshop on Principles of Document Processing (PODP) , p. 27 -- 37 , 1996 . H. Ahonen. Disambiguation of SGML content models. In Workshop on Principles of Document Processing (PODP), p. 27--37, 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-005-1544-y"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346330.1346333"},{"key":"e_1_3_2_1_4_1","volume-title":"Conference on Innovative Data Systems Research (CIDR)","author":"Bernstein P. A.","year":"2003","unstructured":"P. A. Bernstein . Applying Model Management to Classical Meta Data Problems . In Conference on Innovative Data Systems Research (CIDR) , 2003 . P. A. Bernstein. Applying Model Management to Classical Meta Data Problems. In Conference on Innovative Data Systems Research (CIDR), 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017095"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367609"},{"key":"e_1_3_2_1_7_1","first-page":"115","volume-title":"Very Large Data Bases (VLDB)","author":"Bex G. J.","year":"2006","unstructured":"G. J. Bex , F. Neven , T. Schwentick , and K. Tuyls . Inference of concise DTDs from XML data . In Very Large Data Bases (VLDB) , p. 115 -- 126 , 2006 . G. J. Bex, F. Neven, T. Schwentick, and K. Tuyls. Inference of concise DTDs from XML data. In Very Large Data Bases (VLDB), p. 115--126, 2006."},{"key":"e_1_3_2_1_8_1","first-page":"998","volume-title":"Very Large Data Bases (VLDB)","author":"Bex G. J.","year":"2007","unstructured":"G. J. Bex , F. Neven , and S. Vansummeren . Inferring XML schema definitions from XML data . In Very Large Data Bases (VLDB) , p. 998 -- 1009 , 2007 . G. J. Bex, F. Neven, and S. Vansummeren. Inferring XML schema definitions from XML data. In Very Large Data Bases (VLDB), p. 998--1009, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376750"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2695"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0172-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017096"},{"key":"e_1_3_2_1_13_1","first-page":"1297","volume-title":"Very Large Data Bases (VLDB)","author":"Freire J.","year":"2004","unstructured":"J. Freire , F. Du , S. Amer-Yahia . ShreX : Managing XML Documents in Relational Databases . In Very Large Data Bases (VLDB) , p. 1297 -- 1300 , 2004 . J. Freire, F. Du, S. Amer-Yahia. ShreX: Managing XML Documents in Relational Databases. In Very Large Data Bases (VLDB), p. 1297--1300, 2004."},{"key":"e_1_3_2_1_14_1","volume-title":"Parametrized Complexity Theory","author":"Flum J.","year":"2006","unstructured":"J. Flum and M. Grohe . Parametrized Complexity Theory . Springer , 2006 . J. Flum and M. Grohe. Parametrized Complexity Theory. Springer, 2006."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564713"},{"key":"e_1_3_2_1_16_1","first-page":"325","volume-title":"Symposium on Theoretical Aspects of Computer Science (STACS)","author":"Gelade W.","year":"2008","unstructured":"W. Gelade and F. Neven . Succinctness of the complement and intersection of regular expressions . In Symposium on Theoretical Aspects of Computer Science (STACS) , p. 325 -- 336 , 2008 . W. Gelade and F. Neven. Succinctness of the complement and intersection of regular expressions. In Symposium on Theoretical Aspects of Computer Science (STACS), p. 325--336, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1783534.1783557"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458135"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792803.1792823"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.12.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0169-1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316711"},{"key":"e_1_3_2_1_23_1","first-page":"241","volume-title":"Very Large Data Bases (VLDB)","author":"Manolescu Ioana","year":"2001","unstructured":"Ioana Manolescu , Daniela Florescu , and Donald Kossmann . Answering XML Queries on Heterogeneous Data Sources . In Very Large Data Bases (VLDB) , p. 241 -- 250 , 2001 . Ioana Manolescu, Daniela Florescu, and Donald Kossmann. Answering XML Queries on Heterogeneous Data Sources. In Very Large Data Bases (VLDB), p. 241--250, 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_70"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166076"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775223"},{"key":"e_1_3_2_1_27_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."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/321312.321326"},{"key":"e_1_3_2_1_30_1","volume-title":"XML Schema part 1: Structures","author":"Thompson H.S.","year":"2001","unstructured":"H.S. Thompson , D. Beech , M. Maloney , and N. Mendelsohn . XML Schema part 1: Structures . World Wide Web Consortium (W 3C), May 2001 . H.S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. XML Schema part 1: Structures. World Wide Web Consortium (W3C), May 2001."},{"key":"e_1_3_2_1_31_1","unstructured":"E. van der Vlist. XML Schema. O'Reilly 2002.   E. van der Vlist. XML Schema. O'Reilly 2002."},{"key":"e_1_3_2_1_32_1","first-page":"331","volume-title":"Logic and Recursion Theory","author":"van Emde Boas P.","unstructured":"P. van Emde Boas . The convenience of tilings. In Complexity , Logic and Recursion Theory , p. 331 -- 363 . P. van Emde Boas. The convenience of tilings. In Complexity, Logic and Recursion Theory, p. 331--363."}],"event":{"name":"SIGMOD\/PODS '09: International Conference on Management of Data","location":"Providence Rhode Island USA","acronym":"SIGMOD\/PODS '09","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2009 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1559845.1559922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:12Z","timestamp":1750249092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559922"}},"subtitle":["effortless handling of nondeterministic regular expressions"],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":32,"alternative-id":["10.1145\/1559845.1559922","10.1145\/1559845"],"URL":"https:\/\/doi.org\/10.1145\/1559845.1559922","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}