Deciding equivalence of finite tree automata
SIAM Journal on Computing
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
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
An event-condition-action language for XML
Proceedings of the 11th international conference on World Wide Web
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A formal semantics of patterns in XSLT and XPath
Markup Languages
On the Equivalence of XML Patterns
CL '00 Proceedings of the First International Conference on Computational Logic
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Query Optimization for Structured Documents Based on Knowledge on the Document Type Definition
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Query Optimization for Structured Documents Based on Knowledge on the Document Type Definition
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Using Regular Tree Automata as XML Schemas
ADL '00 Proceedings of the IEEE Advances in Digital Libraries 2000
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
XML access control using static analysis
Proceedings of the 10th ACM conference on Computer and communications security
ACM SIGMOD Record
Semantic multicast for content-based stream dissemination
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Logic-based XPath optimization
Proceedings of the 2004 ACM symposium on Document engineering
Finding hot query patterns over an XQuery stream
The VLDB Journal — The International Journal on Very Large Data Bases
SemCast: Semantic Multicast for Content-Based Data Dissemination
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
XML Views as Integrity Constraints and Their Use in Query Translation
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
XQuery containment in presence of variable binding dependencies
WWW '05 Proceedings of the 14th international conference on World Wide Web
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
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
XML Queries and constraints, containment and reformulation
Theoretical Computer Science - Database theory
Applying hierarchical and role-based access control to XML documents
SWS '04 Proceedings of the 2004 workshop on Secure web service
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Accomplishing deterministic XML query optimization
Journal of Computer Science and Technology
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Maintaining XPath views in loosely coupled systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
XML access control using static analysis
ACM Transactions on Information and System Security (TISSEC)
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
A system for the static analysis of XPath
ACM Transactions on Information Systems (TOIS)
Journal of Computer and System Sciences
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
Static validation of XSL transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding XPath containment with MSO
Data & Knowledge Engineering
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On the minimization of XPath queries
Journal of the ACM (JACM)
XML data exchange: Consistency and query answering
Journal of the ACM (JACM)
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic (TOCL)
Revisiting redundancy and minimization in an XPath fragment
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Data & Knowledge Engineering
HCH for checking containment of XPath fragment
Journal of Computer Science and Technology
Minimization of tree pattern queries with constraints
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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
Filtering Techniques for Rewriting XPath Queries Using Views
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
Order-preserving optimization of twig queries with structural preferences
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
ACM Computing Surveys (CSUR)
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
A heuristic approach for checking containment of generalized tree-pattern queries
Proceedings of the 17th ACM conference on Information and knowledge management
Semantics in Data and Knowledge Bases
Expressive, yet tractable XML keys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Containment between Unions of XPath Queries
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
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)
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
On the Termination Problem for Declarative XML Message Processing
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Query rewritings using views for XPath queries, framework, and methodologies
Information Systems
Using semantics for XPath query transformation
International Journal of Web and Grid Services
Numerical constraints on XML data
Information and Computation
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Semantic XPath query transformation: opportunities and performance
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
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
Bag equivalence of XPath queries
Proceedings of the 13th International Conference on Database Theory
XML with incomplete information
Journal of the ACM (JACM)
On the complexity of tree pattern containment with arithmetic comparisons
Information Processing Letters
On equivalence and rewriting of XPath queries using views under DTD constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Bag equivalence of tree patterns
ACM Transactions on Database Systems (TODS)
ICDT'07 Proceedings of the 11th international conference on Database Theory
Hidden conditioned homomorphism for XPath fragment containment
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Detecting privacy violations in sensitive XML databases
SDM'05 Proceedings of the Second VDLB international conference on Secure Data Management
Chasing tree patterns under recursive DTDs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Rewriting XPath queries using materialized XPath views
Journal of Computer and System Sciences
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
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments, deciding containment (and even minimisation) has been shown to be in PTIME, while for minor extensions containment has been shown to be CONP-complete. When containment is with respect to trees satisfying a set of constraints (such as a schema or DTD), the problem seems to be more difficult. For example, containment under DTDs is CONP-complete for an XPath fragment denoted XP{[ ]} for which containment is in PTIME. It is also undecidable for a larger class of XPath queries when the constraints are so-called simple XPath integrity constraints (SXICs). In this paper, we show that containment is decidable for an important fragment of XPath, denoted XP{[ ], *, //}, when the constraints are DTDs. We also identify XPath fragments for which containment under DTDs can be decided in PTIME.