XML with data values: Typechecking revisited.

DOI10.1016/S0022-0000(03)00032-1zbMath1054.68035MaRDI QIDQ1401966

Dan Suciu, Victor Vianu, Tova Milo, Noga Alon, Frank Neven

Publication date: 19 August 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

decidabilityXML queries

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (12)

Well-definedness and semantic type-checking for the nested relational calculus ⋮ Automata for XML -- a survey ⋮ Propagating XML constraints to relations ⋮ Frontiers of tractability for typechecking simple XML transformations ⋮ Backward type inference for XML queries ⋮ Forward and backward application of symbolic tree transducers ⋮ Typechecking top-down XML transformations: Fixed input or output schemas ⋮ Transducer-based analysis of cryptographic protocols ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ On the complexity of typechecking top-down XML transformations ⋮ Modulo constraints and the complexity of typechecking XML views ⋮ Complexity of Data Tree Patterns over XML Documents

Uses Software

• ML
• XQuery

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of querying indefinite data about linearly ordered domains
• Typechecking for XML transformers
• Weak Second‐Order Arithmetic and Finite Automata
• The implication problem for functional and inclusion dependencies
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• Regular expression pattern matching for XML
• Typechecking XML views of relational databases

This page was built for publication: XML with data values: Typechecking revisited.