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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Wouter Gelade (Hasselt University; Transnational University of Limburg)
- 2. Tomasz Idziaszek (University of Warsaw)
- 3. Wim Martens (Technical University of Dortmund)
- 4. Frank Neven (Hasselt University; Transnational University of Limburg)
BibTeX Citation
@inproceedings{gelade_pods10,
address = {New York, NY, USA},
series = {{PODS} '10},
title = {{Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages}},
url = {https://dl.acm.org/doi/10.1145/1807085.1807118},
doi = {10.1145/1807085.1807118},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gelade, Wouter and Idziaszek, Tomasz and Martens, Wim and Neven, Frank},
year = {2010}
}
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 |
|---|---|---|---|---|
| 184 | Applying Model Management to Classical Meta Data Problems | 2003 | CIDR | 0.00026183186 |
| 1,296 | DTD Inference for Views of XML Data | 2000 | PODS | 0.00011264833 |
| 2,801 | Inferring XML Schema Definitions from XML Data | 2007 | VLDB | 8.0863546e-05 |
| 12,553 | Simplifying XML Schema: Effortless Handling of Nondeterministic Regular Expressions | 2009 | SIGMOD | 5.0723324e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,801 | Inferring XML Schema Definitions from XML Data | 2007 | VLDB |
| 2 | 12,464 | Schema Design for XML Repositories: Complexity and Tractability | 2010 | PODS |
| 3 | 13,897 | Regular Rewriting of Active XML and Unambiguity | 2005 | PODS |
| 4 | 14,005 | On the Power of Walking for Querying Tree-Structured Data | 2002 | PODS |
| 5 | 12,463 | Certain Answers for XML Queries | 2010 | PODS |
| 6 | 3,288 | Frontiers of Tractability for Typechecking Simple XML Transformations | 2004 | PODS |
| 7 | 2,875 | Typing and Querying XML Documents: Some Complexity Bounds | 2003 | PODS |
| 8 | 8,449 | XML Schema Mappings | 2009 | PODS |
| 9 | 12,678 | The Complexity of Reasoning about Pattern-based XML Schemas | 2007 | PODS |
| 10 | 12,553 | Simplifying XML Schema: Effortless Handling of Nondeterministic Regular Expressions | 2009 | SIGMOD |