Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
On the Intersection of XPath Expressions
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Conjunctive queries over trees
Journal of the ACM (JACM)
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Deciding XPath containment with MSO
Data & Knowledge Engineering
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Commutativity analysis for XML updates
ACM Transactions on Database Systems (TODS)
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)
Constraint Handling Rules
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Detecting conflicts among declarative UI extensions
Proceedings of the 8th symposium on Dynamic languages
Revisiting “forward node-selecting queries over trees”
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We investigate the satisfiability problem for conjunctions of constraints over ordered, unranked trees, including child, descendant, following-sibling, root, leaf, and first/last child constraints. We introduce new, symbolic approaches based on graph transformations, which simplify and check the consistency of a problem first, and delay blind search as long as possible. We prove correctness and termination for these algorithms. We also analyze the complexity of important special cases: binary and κ-ary intersection of certain classes of XPath expressions. Our main complexity result is that binary intersection (for positive, simple navigational XPath over all axes) is tractable for expressions with a bounded number of changes in direction in the path, which is typically small.