Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
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
Algorithms for Guided Tree Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
ACM SIGMOD Record
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third 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
Temporal Logics over Unranked Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Tree acceptors and some of their applications
Journal of Computer and System Sciences
A decision procedure for the alternation-free two-way modal µ-calculus
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
XPathMark: an XPath benchmark for the XMark generated data
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Debugging standard document formats
Proceedings of the 19th international conference on World wide web
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Extending the tractability results on XPath satisfiability with sibling axes
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
XML query-update independence analysis revisited
Proceedings of the 2012 ACM symposium on Document engineering
XPath satisfiability with downward and sibling axes is tractable under most of real-world DTDs
Proceedings of the twelfth international workshop on Web information and data management
| Hi-index | 0.00 |
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath fragment covers most of the language features used in practice. Specifically, we show how XPath queries can be translated into equivalent formulas in monadic second-order logic. Using this translation, we construct an optimized logical formulation of the containment problem, which is decided using tree automata. When the containment relation does not hold between two XPath expressions, a counter-example XML tree is generated. We provide practical experiments that illustrate the efficiency of the decision procedure for realistic scenarios.