XML queries and constraints, containment and reformulation

DOI10.1016/j.tcs.2004.10.032zbMath1080.68024OpenAlexW2088004976MaRDI QIDQ555769

Alin Deutsch, Val Tannen

Publication date: 10 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.032

zbMATH Keywords

XBind,

Mathematics Subject Classification ID

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

Related Items

Exploring Theories with a Model-Finding Assistant, Relaxed notions of schema mapping equivalence revisited, Automata for XML -- a survey, On the complexity of tree pattern containment with arithmetic comparisons, Reasoning about XML update constraints, Computational complexity of the problem of tree generation under fine-grained access control policies

Uses Software

• MiniCon
• XPath
• XPERANTO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Answering queries using limited external query processors
• MiniCon: a scalable algorithm for answering queries using views
• A Proof Procedure for Data Dependencies
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Containment and equivalence for a fragment of XPath
• Answering queries using views: A survey