Containment and equivalence for an XPath fragment

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2002, Pages 65-76

  Miklau, Gerome ^a   Suciu, Dan ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA STRUCTURES; EQUIVALENCE CLASSES; OPTIMIZATION; PROBLEM SOLVING; XML;

CONTAINMENT ALGORITHMS; SOFTWARE PACKAGE XPATH;

QUERY LANGUAGES;

EID: 0036038432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/543613.543623     Document Type: Conference Paper

References (27)

1. Minimization of tree pattern queries
2. View-based query answering and query containment over semistructured data
3. XQuery 1.0: An XML query language
4. Alternation
5. Optimal implementation of conjunctive queries in relational data bases
6. Tree pattern matching and subset matching in deterministic o(nlog3n) time
7. XML pointer language (XPointer) working draft
8. Xml linking language (Xlink)
9. Containment and integrity constraints for XPath fragments
10. Query containment for conjunctive queries with regular expressions
11. Pattern matching in trees
12. Ordered and unordered tree inclusion
13. Efficient tree pattern matching
14. Containment and equivalence of tree patterns
15. Index structures for path expressions
16. Equivalence of datalog queries is undecidable
17. Mesh-based content routing using XML
18. Word problems requiring exponential time
19. A formal semantics of patterns in xslt
20. On the equivalence of xml patterns
21. Minimizing simple xpath expressions
22. XML schema part 1: Structures
23. Algorithms for acyclic database schemes