Containment and Optimization of Object-Preserving Conjunctive Queries
SIAM Journal on Computing
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Conjunctive queries over trees
Journal of the ACM (JACM)
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Simulation Subsumption or Déjà vu on the Web
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability and relevance for queries over active documents
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with incomplete information: models, properties, and query answering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Disjoint pattern matching and implication in strings
Information Processing Letters
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
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
XML with incomplete information
Journal of the ACM (JACM)
Solutions in XML data exchange
Proceedings of the 14th International Conference on Database Theory
Conjunctive query containment over trees
Journal of Computer and System Sciences
Incomplete information and certain answers in general data models
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tractable XML data exchange via relations
Proceedings of the 20th ACM international conference on Information and knowledge management
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
Solutions in XML data exchange
Journal of Computer and System Sciences
Querying Regular Graph Patterns
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, their transitive and reflexive closures, and Following. For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or Π2P -complete. For the satisfiability problem most problems are classified as either in PTIME or NP-complete.