Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Science of Computer Programming
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
WWW '99 Proceedings of the eighth international conference on World Wide Web
Optimising Web queries using document type definitions
Proceedings of the 2nd international workshop on Web information and data management
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-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
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Understanding and Deploying LDAP Directory Services
Understanding and Deploying LDAP Directory Services
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Recursive XML Schemas, Recursive XML Queries, and Relational Storage: XML-to-SQL Query Translation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
XML Views as Integrity Constraints and Their Use in Query Translation
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient algorithms for processing XPath queries
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
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Using partial evaluation in distributed query evaluation
VLDB '06 Proceedings of the 32nd 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
Distributed query evaluation with performance guarantees
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Covering indexes for XML queries: bisimulation - simulation = negation
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient XML-to-SQL query translation: where to add the intelligence?
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Taming XPath queries by minimizing wildcard steps
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The NEXT framework for logical XQuery optimization
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Filtering unsatisfiable XPath queries
Data & Knowledge Engineering
On the minimization of XPath queries
Journal of the ACM (JACM)
Revisiting redundancy and minimization in an XPath fragment
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Minimization of tree pattern queries with constraints
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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
Containment of partially specified tree-pattern queries in the presence of dimension graphs
The VLDB Journal — The International Journal on Very Large Data Bases
Using semantics for XPath query transformation
International Journal of Web and Grid Services
Tree patterns with full text search
Procceedings of the 13th International Workshop on the Web and Databases
A utilization of schema constraints to transform predicates in XPath query
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Ideal downward refinement in the EL description logic
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Rewriting XPath queries using materialized XPath views
Journal of Computer and System Sciences
Adding logical operators to tree pattern queries on graph-structured data
Proceedings of the VLDB Endowment
Partial Evaluation for Distributed XPath Query Processing and Beyond
ACM Transactions on Database Systems (TODS)
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
| Hi-index | 0.00 |
We consider the problem of minimizing tree pattern queries (TPQ) that arise in XML and in LDAP-style network directories. In [Minimization of Tree Pattern Queries, Proc. ACM SIGMOD Intl. Conf. Management of Data, 2001, pp. 497-508], Amer-Yahia, Cho, Lakshmanan and Srivastava presented an O(n4) algorithm for minimizing TPQs in the absence of integrity constraints (Case 1); n is the number of nodes in the query. Then they considered the problem of minimizing TPQs in the presence of three kinds of integrity constraints: required-child, required-descendant and subtype (Case 2). They presented an O(n6) algorithm for minimizing TPQs in the presence of only required-child and required-descendant constraints (i.e., no subtypes allowed; Case 3). We present O(n2), O(n4) and O(n2) algorithms for minimizing TPQs in these three cases, respectively, based on the concept of graph simulation. We believe that our O(n2) algorithms for Cases 1 and 3 are runtime optimal.