{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T22:33:11Z","timestamp":1785796391553,"version":"3.56.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2007,9]]},"abstract":"<jats:p>Although the advent of XML Schema [25] has rendered DTDs obsolete, research on practical XML optimization is mostly biased towards DTDs and tends to largely ignore XSDs (some notable exceptions non-withstanding). One of the underlying reasons is most probably the perceived simplicity of DTDs versus the alleged impenetrability of XML Schema. Indeed, optimization w.r.t. DTDs has a local flavor and usually reduces to reasoning about the accustomed formalism of regular expressions. XSDs, on the other hand, even when sufficiently stripped down, are related to the less pervious class of unranked regular tree automata [6, 19, 20, 21]. Recent results on the structural expressiveness of XSDs [19], however, show that XSDs are in fact much closer to DTDs than to tree automata, leveraging the possibility to directly extend techniques for DTD-based XML optimization to the realm of XML Schema. The goal of the present paper is to present the results in [19] in an easy and accessible way. At the same time, we discuss possible applications, related research, and future research directions. Throughout the paper, we try to restrict notation to a minimum. We refer to [19] for further details.<\/jats:p>","DOI":"10.1145\/1324185.1324188","type":"journal-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:01Z","timestamp":1197055141000},"page":"15-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Simple off the shelf abstractions for XML schema"],"prefix":"10.1145","volume":"36","author":[{"given":"Wim","family":"Martens","sequence":"first","affiliation":[{"name":"University of Dortmund"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[{"name":"Hasselt University and transnational University of Limburg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[{"name":"University of Dortmund"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,9]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"115","volume-title":"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 VLDB , pages 115 -- 126 , 2006 . G. J. Bex, F. Neven, T. Schwentick, and K. Tuyls. Inference of concise DTDs from XML data. In VLDB, pages 115--126, 2006."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017095"},{"key":"e_1_2_1_3_1","first-page":"998","volume-title":"VLDB","author":"Bex G. J.","year":"2007","unstructured":"G. J. Bex , F. Neven , and S. Vansummeren . Inferring XML Schema Definitions from XML data . In VLDB , pages 998 -- 1009 , 2007 . G. J. Bex, F. Neven, and S. Vansummeren. Inferring XML Schema Definitions from XML data. In VLDB, pages 998--1009, 2007."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90287-4"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2688"},{"key":"e_1_2_1_7_1","volume-title":"OASIS","author":"Clark J.","year":"2001","unstructured":"J. Clark and M. Murata . RELAX NG Specification . OASIS , December 2001 . J. Clark and M. Murata. RELAX NG Specification. OASIS, December 2001."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988695"},{"key":"e_1_2_1_9_1","unstructured":"R. Cover. The Cover pages. http:\/\/xml.coverpages.org\/ 2005.  R. Cover. The Cover pages. http:\/\/xml.coverpages.org\/ 2005."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11965893_19"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1783534.1783555"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1783534.1783557"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265552"},{"key":"e_1_2_1_14_1","first-page":"163","volume-title":"SPLST","author":"Kilpel\u00e4inen P.","year":"2003","unstructured":"P. Kilpel\u00e4inen and R. Tuhkanen . Regular expressions with numerical occurrence indicators - preliminary results . In SPLST , pages 163 -- 173 , 2003 . P. Kilpel\u00e4inen and R. Tuhkanen. Regular expressions with numerical occurrence indicators - preliminary results. In SPLST, pages 163--173, 2003."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030397.1030441"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.12.003"},{"key":"e_1_2_1_17_1","volume-title":"Extreme Markup Languages","author":"Mani M.","year":"2001","unstructured":"M. Mani . Keeping chess alive --- Do we need 1-unambiguous content models ? In Extreme Markup Languages , Montreal, Canada , 2001 . M. Mani. Keeping chess alive --- Do we need 1-unambiguous content models? In Extreme Markup Languages, Montreal, Canada, 2001."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_70"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166076"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111627.1111631"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601869"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543622"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219027"},{"key":"e_1_2_1_24_1","volume-title":"XML --- Conference Proceedings","author":"Sperberg-McQueen C. M.","year":"2003","unstructured":"C. M. Sperberg-McQueen . XML Schema 1.0 : A language for document grammars . In XML --- Conference Proceedings , 2003 . C. M. Sperberg-McQueen. XML Schema 1.0: A language for document grammars. In XML --- Conference Proceedings, 2003."},{"key":"e_1_2_1_25_1","volume-title":"XML Schema. Technical report","author":"Sperberg-McQueen C. M.","year":"2005","unstructured":"C. M. Sperberg-McQueen and H. Thompson . XML Schema. Technical report , World Wide Web Consortium , 2005 . http:\/\/www.w3.org\/XML\/Schema. C. M. Sperberg-McQueen and H. Thompson. XML Schema. Technical report, World Wide Web Consortium, 2005. http:\/\/www.w3.org\/XML\/Schema."},{"key":"e_1_2_1_26_1","unstructured":"E. van der Vlist. XML Schema. O'Reilly 2002.   E. van der Vlist. XML Schema . O'Reilly 2002."}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1324185.1324188","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1324185.1324188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:15Z","timestamp":1750254975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1324185.1324188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1324185.1324188"],"URL":"https:\/\/doi.org\/10.1145\/1324185.1324188","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}