Journal of Computer and System Sciences
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Tree logical classes for efficient evaluation of XQuery
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Frontiers of tractability for typechecking simple XML transformations
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
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Semantic characterizations of navigational XPath
ACM SIGMOD Record
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
XML Queries and constraints, containment and reformulation
Theoretical Computer Science - Database theory
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th 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
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability of downward XPath with data equality tests
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
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
On the analysis of queries with counting constraints
Proceedings of the 9th ACM symposium on Document engineering
Query translation from XPath to SQL in the presence of recursive DTDs
The VLDB Journal — The International Journal on Very Large Data Bases
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Static analysis of active XML systems
ACM Transactions on Database Systems (TODS)
Satisfiability of simple xpath fragments in the presence of dtds
Proceedings of the eleventh international workshop on Web information and data management
Inference of concise regular expressions and DTDs
ACM Transactions on Database Systems (TODS)
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
ACM Transactions on Database Systems (TODS)
Ambiguous content and disambiguation of XML schemata
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
XML with incomplete information
Journal of the ACM (JACM)
Consistent query answers from virtually integrated XML data
Journal of Systems and Software
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
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Solutions in XML data exchange
Proceedings of the 14th International Conference on Database Theory
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
On the complexity of tree pattern containment with arithmetic comparisons
Information Processing Letters
Predicting the maintainability of XSL transformations
Science of Computer Programming
Streamable fragments of forward XPath
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Detecting and resolving conflicts between adaptation aspects in multi-staged XML transformations
Proceedings of the 11th ACM symposium on Document engineering
Satisfiability of simple Xpath fragments under fixed DTDs
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
On the data complexity of consistent query answering
Proceedings of the 15th International Conference on Database Theory
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Regular path queries on graphs with data
Proceedings of the 15th International Conference on Database Theory
Repairing XML functional dependency violations
Information Sciences: an International Journal
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
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
Detecting conflicts among declarative UI extensions
Proceedings of the 8th symposium on Dynamic languages
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
Containment and satisfiability problem for XPath with recursion
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Optimizing XML querying using type-based document projection
ACM Transactions on Database Systems (TODS)
Recursive queries on trees and data trees
Proceedings of the 16th International Conference on Database Theory
A survey on XML streaming evaluation techniques
The VLDB Journal — The International Journal on Very Large Data Bases
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
Learning queries for relational, semi-structured, and graph databases
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
Solutions in XML data exchange
Journal of Computer and System Sciences
Complexity of two-variable logic on finite trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Early nested word automata for XPath query answering on XML streams
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or not there exists an XML document T such that T conforms to D and the answer of p on T is nonempty. We consider a variety of XPath fragments widely used in practice, and investigate the impact of different XPath operators on the satisfiability analysis. We first study the problem for negation-free XPath fragments with and without upward axes, recursion and data-value joins, identifying which factors lead to tractability and which to NP-completeness. We then turn to fragments with negation but without data values, establishing lower and upper bounds in the absence and in the presence of upward modalities and recursion. We show that with negation the complexity ranges from PSPACE to EXPTIME. Moreover, when both data values and negation are in place, we find that the complexity ranges from NEXPTIME to undecidable. Furthermore, we give a finer analysis of the problem for particular classes of DTDs, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone. Finally, we investigate the problem for XPath fragments with sibling axes, exploring the impact of horizontal modalities on the satisfiability analysis.