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
Efficient algorithms for minimizing tree pattern queries
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
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the minimization of XPath queries
Journal of the ACM (JACM)
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
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
Containment of pattern-based queries over data trees
Proceedings of the 16th International Conference on Database Theory
| Hi-index | 0.00 |
Redundancy and minimization of queries are investigated in a well known fragment of XPath that includes child and descendant edges, branches, wildcards, and multiple output nodes. Contrary to a published result, a proposed technique does not guarantee minimality or even non-redundancy, and it is unknown whether a non-redundant query is also minimal. It is shown that for two sub-fragments, non-redundancy and minimality are the same, and can be realized by means of simple (local) tests. The latter property is used to prove that testing non-redundancy is NP-complete.