Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automata theory for XML researchers
ACM SIGMOD Record
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Conjunctive queries over trees
Journal of the ACM (JACM)
XML data exchange: Consistency and query answering
Journal of the ACM (JACM)
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Optimizing Conjunctive Queries over Trees Using Schema Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Complexity of Data Tree Patterns over XML Documents
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Conjunctive query containment over trees
DBPL'07 Proceedings of the 11th international conference on Database programming languages
On the tradeoff between mapping and querying power in XML data exchange
Proceedings of the 13th International Conference on Database Theory
Certain answers for XML queries
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Solutions in XML data exchange
Proceedings of the 14th International Conference on Database Theory
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
In static analysis of queries over trees in the presence of schemas, there is an exponential complexity gap between conjunctive queries (CQs, positive existential first-order formulae without disjunction) and tree patterns (tree-like acyclic CQs). Motivated by applications in XML data management, we consider various restrictions of CQs that bring their complexity down to that of tree patterns. Most importantly, we show that vertical tree patterns can be costlessly extended with full horizontal CQs over children. We also consider restricted classes of schemas and show that under disjunction-free schemas the complexity of static analysis sometimes drops dramatically.