Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth 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
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
The VLDB Journal — The International Journal on Very Large Data Bases
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On determining the consistency of partial descriptions of trees
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth 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
Deciding well-definedness of XQuery fragments
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XQBE (XQuery By Example): A visual interface to the standard XML query language
ACM Transactions on Database Systems (TODS)
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Optimization of nested XQuery expressions with orderby clauses
Data & Knowledge Engineering
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
Self-correcting queries for xml
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Filtering unsatisfiable XPath queries
Data & Knowledge Engineering
XML data exchange: Consistency and query answering
Journal of the ACM (JACM)
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Output schemas of XSLT stylesheets and their applications
Information Sciences: an International Journal
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
Contained Rewritings of XPath Queries Using Views Revisited
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Transforming Tree Patterns with DTDs for Query Containment Test
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
ACM Computing Surveys (CSUR)
A heuristic approach for checking containment of generalized tree-pattern queries
Proceedings of the 17th ACM conference on Information and knowledge management
Containment between Unions of XPath Queries
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Containment of partially specified tree-pattern queries in the presence of dimension graphs
The VLDB Journal — The International Journal on Very Large Data Bases
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Information Systems
Information Systems
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
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
Efficient top-k search across heterogeneous XML data sources
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
Tractable XML data exchange via relations
Proceedings of the 20th ACM international conference on Information and knowledge management
Satisfiability of simple Xpath fragments under fixed DTDs
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A prototype of a schema-based XPath satisfiability tester
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Hi-index | 0.00 |
XPath and XQuery (which includes XPath as a sublanguage) are the major query languages for XML. An important issue arising in efficient evaluation of queries expressed in these languages is satisfiability, i.e., whether there exists a database, consistent with the schema if one is available, on which the query has a non-empty answer. Our experience shows satisfiability check can effect substantial savings in query evaluation. We systematically study satisfiability of tree pattern queries (which capture a useful fragment of XPath) together with additional constraints, with or without a schema. We identify cases in which this problem can be solved in polynomial time and develop novel efficient algorithms for this purpose. We also show that in several cases, the problem is NP-complete. We ran a comprehensive set of experiments to verify the utility of satisfiability check as a preprocessing step in query processing. Our results show that this check takes a negligible fraction of the time needed for processing the query while often yielding substantial savings.