Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Conjunctive queries over trees
Journal of the ACM (JACM)
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Optimizing Conjunctive Queries over Trees Using Schema Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
ACM Computing Surveys (CSUR)
Conjunctive query containment over trees
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Optimizing Conjunctive Queries over Trees Using Schema Information
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
XML with incomplete information
Journal of the ACM (JACM)
Solutions in XML data exchange
Proceedings of the 14th International Conference on Database Theory
On the complexity of tree pattern containment with arithmetic comparisons
Information Processing Letters
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Recursive queries on trees and data trees
Proceedings of the 16th International Conference on Database Theory
Containment of pattern-based queries over data trees
Proceedings of the 16th International Conference on Database Theory
Solutions in XML data exchange
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We consider Boolean combinations of data tree patterns as a specification and query language for XML documents. Data tree patterns are tree patterns plus variable (in)equalities which express joins between attribute values. Data tree patterns are a simple and natural formalism for expressing properties of XML documents. We consider first the model checking problem (query evaluation), we show that it is DP-complete in general and already NP-complete when we consider a single pattern. We then consider the satisfiability problem in the presence of a DTD. We show that it is in general undecidable and we identify several decidable fragments.