Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Foundations of semantic query optimization for deductive databases
Foundations of deductive databases and logic programming
Boundedness is undecidable for datalog programs with a single recursive rule
Information Processing Letters
Containment and minimization of positive conjunctive queries in OODB's
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
On the complexity of the containment problem for conjunctive queries with built-in predicates
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial-time program transformations in deductive databases
PODS '90 Proceedings of the ninth 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
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On wrapping query languages and efficient XML integration
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
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
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
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
Optimization Properties for Classes of Conjunctive Regular Path Queries
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
ACM SIGMOD Record
A Fast Tree Pattern Matching Algorithm for XML Query
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
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)
Revisiting redundancy and minimization in an XPath fragment
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
HCH for checking containment of XPath fragment
Journal of Computer Science and Technology
Deciding equivalence of top--down XML transformations in polynomial time
Journal of Computer and System Sciences
Containment between Unions of XPath Queries
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Journal of Systems and Software
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
Efficient rewriting of XPath queries using Query Set Specifications
Proceedings of the VLDB Endowment
Numerical constraints on XML data
Information and Computation
Effective pruning for XML structural match queries
Data & Knowledge Engineering
TGV: a tree graph view for modeling untyped XQuery
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Understanding queries in a search database system
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying XML data sources that export very large sets of views
ACM Transactions on Database Systems (TODS)
Solutions in XML data exchange
Proceedings of the 14th International Conference on Database Theory
Algebraic incremental maintenance of XML views
Proceedings of the 14th International Conference on Extending Database Technology
Rapid development of web-based query interfacesfor XML datasets with QURSED
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Evaluating contained rewritings for XPath queries on materialized views
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Tractable XML data exchange via relations
Proceedings of the 20th ACM international conference on Information and knowledge management
Hidden conditioned homomorphism for XPath fragment containment
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Rewriting XPath queries using materialized XPath views
Journal of Computer and System Sciences
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
XML data exchange with target constraints
Information Processing and Management: an International Journal
Containment of pattern-based queries over data trees
Proceedings of the 16th International Conference on Database Theory
Solutions in XML data exchange
Journal of Computer and System Sciences
Algebraic incremental maintenance of XML views
ACM Transactions on Database Systems (TODS)
Reasoning about pattern-based XML queries
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
Tree patterns form a natural basis to query tree-structured data such as XML and LDAP. To improve the efficiency of tree pattern matching, it is essential to quickly identify and eliminate redundant nodes in the pattern. In this paper, we study tree pattern minimization both in the absence and in the presence of integrity constraints (ICs) on the underlying tree-structured database. In the absence of ICs, we develop a polynomial-time query minimization algorithm called CIM, whose efficiency stems from two key properties: (i) a node cannot be redundant unless its children are; and (ii) the order of elimination of redundant nodes is immaterial. When ICs are considered for minimization, we develop a technique for query minimization based on three fundamental operations: augmentation (an adaptation of the well-known chase procedure), minimization (based on homomorphism techniques), and reduction. We show the surprising result that the algorithm, referred to as ACIM, obtained by first augmenting the tree pattern using ICs, and then applying CIM, always finds the unique minimal equivalent query. While ACIM is polynomial time, it can be expensive in practice because of its inherent non-locality. We then present a fast algorithm, CDM, that identifies and eliminates local redundancies due to ICs, based on propagating ”information labels” up the tree pattern. CDM can be applied prior to ACIM for improving the minimization efficiency. We complement our analytical results with an experimental study that shows the effectiveness of our tree pattern minimization techniques.