The complexity of query containment in expressive fragments of XPath 2.0
- 11 June 2007
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '07
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Expressiveness and complexity of XML SchemaACM Transactions on Database Systems, 2006
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variablesLogical Methods in Computer Science, 2006
- Conditional XPathACM Transactions on Database Systems, 2005
- Taxonomy of XML schema languages using formal language theoryACM Transactions on Internet Technology, 2005
- Semantic characterizations of navigational XPathACM SIGMOD Record, 2005
- Structural properties of XPath fragmentsTheoretical Computer Science, 2005
- The complexity of XPath query evaluation and XML typingJournal of the ACM, 2005
- XPath query containmentACM SIGMOD Record, 2004
- First-Order Logic with Two Variables and Unary Temporal LogicInformation and Computation, 2002
- AlternationJournal of the ACM, 1981