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
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Structural Properties of XPath Fragments
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
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
Conjunctive queries over trees
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
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Testing XML constraint satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
Static analysis of XML processing with data values
ACM SIGMOD Record
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
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)
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
On the Termination Problem for Declarative XML Message Processing
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Satisfiability of simple xpath fragments in the presence of dtds
Proceedings of the eleventh international workshop on Web information and data management
A decision procedure for XPath satisfiability in the presence of DTD containing choice
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
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
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Satisfiability of simple Xpath fragments under fixed DTDs
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Axiomatizing the logical core of XPath 2.0
ICDT'07 Proceedings of the 11th international conference on Database Theory
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Count-Constraints for generating XML
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On XPath with transitive axes and data tests
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
We study the satisfiability problem for XPath fragments supporting the following-sibling and preceding-sibling axes. Although this problem was recently studied for XPath fragments without sibling axes, little is known about the impact of the sibling axes on the satisfiability analysis. To this end we revisit the satisfiability problem for a variety of XPath fragments with sibling axes, in the presence of DTDs, in the absence of DTDs, and under various restricted DTDs. In these settings we establish complexity bounds ranging from NLOGSPACE to undecidable. Our main conclusion is that in many cases, the presence of sibling axes complicates the satisfiability analysis. Indeed, we show that there are XPath satisfiability problems that are in PTIME and PSPACE in the absence of sibling axes, but that become NP-hard and EXPTIME-hard, respectively, when sibling axes are used instead of the corresponding vertical modalities (e.g., the wildcard and the descendant axis).