Database Paper Browser

Back to papers

Simplifying XML Schema: Effortless Handling of Nondeterministic Regular Expressions

Summary: Automates transforming nondeterministic XML Schema regular expressions into equivalent deterministic ones or practical approximations, relieving the UPA burden. Delivers concise XSDs and can plug into model-management tools to export to XML Schema. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4160
Venue
SIGMOD
Year
2009
Pagerank
4.1945683e-05
Overall Rank
12,306 | 14.39%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
8,255 Discovering XSD Keys from XML Data 2013 SIGMOD 4.5491362e-05
12,147 Developing and Analyzing XSDs through BonXai 2012 VLDB 4.1945683e-05
12,216 Schema Design for XML Repositories: Complexity and Tractability 2010 PODS 4.1945683e-05
12,217 Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages 2010 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers