Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/9908
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBEX, Geert Jan-
dc.contributor.authorGELADE, Wouter-
dc.contributor.authorMARTENS, Wim-
dc.contributor.authorNEVEN, Frank-
dc.date.accessioned2009-10-27T10:58:12Z-
dc.date.available2009-10-27T10:58:12Z-
dc.date.issued2009-
dc.identifier.citationCetintemel, Ugur & Zdonik, Stanley & Kossmann, Donald & Tatbul, Nesime (Ed.) Proceedings of the 35th SIGMOD international conference on Management of data. p. 731-744.-
dc.identifier.isbn978-1-60558-551-2-
dc.identifier.urihttp://hdl.handle.net/1942/9908-
dc.description.abstractWhether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many nontransparent restrictions unnecessarily complicate the design of XSDs. For instance, complex content models in XML Schema are constrained by the infamous unique particle attribution (UPA) constraint. In formal language theoretic terms, this constraint restricts content models to deterministic regular expressions. As the latter constitute a semantic notion and no simple corresponding syntactical characterization is known, it is very difficult for non-expert users to understand exactly when and why content models do or do not violate UPA. In the present paper, we therefore investigate solutions to relieve users from the burden of UPA by automatically transforming nondeterministic expressions into concise deterministic ones defining the same language or constituting good approximations. The presented techniques facilitate XSD construction by reducing the design task at hand more towards the complexity of the modeling task. In addition, our algorithms can serve as a plug-in for any model management tool which supports export to XML Schema format.-
dc.language.isoen-
dc.publisherACM-
dc.relation.ispartofseriesInternational Conference on Management of Data-
dc.subject.otherXML Schema; UPA; deterministic regular expressions-
dc.subject.otherXML Schema, UPA, deterministic regular expressions-
dc.titleSimplifying XML schema: effortless handling of nondeterministic regular expressions-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsCetintemel, Ugur-
local.bibliographicCitation.authorsZdonik, Stanley-
local.bibliographicCitation.authorsKossmann, Donald-
local.bibliographicCitation.authorsTatbul, Nesime-
local.bibliographicCitation.conferencename35th ACM SIGMOD International Conference on Management of Data-
local.bibliographicCitation.conferenceplaceProvidence, Rhode Island, USA, , June 29 - July 2, 2009-
dc.identifier.epage744-
dc.identifier.spage731-
local.bibliographicCitation.jcatC1-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
dc.bibliographicCitation.oldjcatC2-
dc.identifier.doi10.1145/1559845.1559922-
dc.identifier.isi000301205700058-
local.bibliographicCitation.btitleProceedings of the 35th SIGMOD international conference on Management of data-
item.validationecoom 2014-
item.fulltextWith Fulltext-
item.contributorBEX, Geert Jan-
item.contributorNEVEN, Frank-
item.contributorMARTENS, Wim-
item.contributorGELADE, Wouter-
item.fullcitationBEX, Geert Jan; GELADE, Wouter; MARTENS, Wim & NEVEN, Frank (2009) Simplifying XML schema: effortless handling of nondeterministic regular expressions. In: Cetintemel, Ugur & Zdonik, Stanley & Kossmann, Donald & Tatbul, Nesime (Ed.) Proceedings of the 35th SIGMOD international conference on Management of data. p. 731-744..-
item.accessRightsOpen Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
sigmod09.pdfPreprint246.66 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.