DBScholar

Back to papers

Deciding Well-Definedness of XQuery Fragments

Summary: Analyzes well-definedness (no run-time errors) for non-recursive XQuery fragments under a bounded-depth type system: given an expression and input type, decide if it’s defined on all conforming inputs. Characterizes base-operation features causing undecidability and gives sufficient conditions ensuring decidability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1338
Venue
PODS
Year
2005
Pagerank
5.2373357e-05
Overall Rank
9,678 | 33.61%
DOI
10.1145/1065167.1065173

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{vansummeren_pods05,
        address = {New York, NY, USA},
        series = {{PODS} '05},
        title = {{Deciding Well-Definedness of XQuery Fragments}},
        url = {https://dl.acm.org/doi/10.1145/1065167.1065173},
        doi = {10.1145/1065167.1065173},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Vansummeren, Stijn},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,936 Rewriting Nested XML Queries Using Nested Views 2006 SIGMOD 6.0353909e-05
7,270 A Crash Course on Database Queries 2007 PODS 5.6595955e-05
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
475 A Calculus for Complex Objects 1986 PODS 0.00017864549
3,679 XML with Data Values: Typechecking Revisited 2001 PODS 7.2045472e-05
4,537 On Testing Satisfiability of Tree Pattern Queries 2004 VLDB 6.6417534e-05
6,185 Containment of Nested XML Queries 2004 VLDB 5.9488248e-05
Previous Page 1 / 1 Next

Semantically Similar Papers