Database Paper Browser

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
1339
Venue
PODS
Year
2005
Pagerank
4.3290808e-05
Overall Rank
9,530 | 33.71%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,300 Rewriting Nested XML Queries Using Nested Views 2006 SIGMOD 5.1223169e-05
7,238 A Crash Course on Database Queries 2007 PODS 4.7928464e-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
440 A Calculus for Complex Objects 1986 PODS 0.00023084404
3,427 XML with Data Values: Typechecking Revisited 2001 PODS 7.1033924e-05
4,625 On Testing Satisfiability of Tree Pattern Queries 2004 VLDB 6.0406081e-05
6,294 Containment of Nested XML Queries 2004 VLDB 5.1255418e-05
Previous Page 1 / 1 Next

Semantically Similar Papers