Database Paper Browser

Back to papers

Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages

Summary: Characterizes how XSDs (single-type regular tree languages) can approximate unions and set differences they are not closed under, by computing optimal lower and upper single-type approximations. Also studies approximating arbitrary regular tree languages by XSDs and complexity of the associated decision problems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1524
Venue
PODS
Year
2010
Pagerank
4.1945683e-05
Overall Rank
12,217 | 15.01%
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 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
188 Applying Model Management to Classical Meta Data Problems 2003 CIDR 0.00035968389
882 DTD Inference for Views of XML Data 2000 PODS 0.00015657456
2,864 Inferring XML Schema Definitions from XML Data 2007 VLDB 7.9863574e-05
12,306 Simplifying XML Schema: Effortless Handling of Nondeterministic Regular Expressions 2009 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers