Download:
by Xin Dong, Alon Y. Halevy, Igor Tatarinov
In VLDB
http://data.cs.washington.edu/p2p/piazza/../../papers/nest_vldb.pdf
Add To MetaCart
Abstract:
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q ′ if the answer for Q is always a subset of the answer for Q ′ , independent of the current state of the database. Query containment is an important problem in a wide variety of data management applications, including verification of integrity constraints, reasoning about contents of data sources in data integration, semantic caching, verification of knowledge bases, determining queries independent of updates, and most recently, in query reformulation for peer data management systems. Query containment has been studied extensively in the relational context and for XPath queries, but not for XML queries with nesting. We consider the theoretical aspects of the problem of query containment for XML queries with nesting. We begin by considering conjunctive XML queries (c-XQueries), and show that containment is in polynomial time if we restrict the fanout (number of sibling sub-blocks) to be 1. We prove that for arbitrary fanout, containment is coNP-hard already for queries with nesting depth 2, even if the query does not include variables in the return clauses. We then show that for queries with fixed nesting depth, containment is coNP-complete. Next, we establish the computational complexity of query containment for several practical extensions of c-XQueries, including queries with union and arithmetic comparisons, and queries where the XPath expressions may include descendant edges and negation. Finally, we describe a few heuristics for speeding up query containment checking in prac-
Citations
|
391
|
A Query Language and Optimization Techniques for Unstructured Data
– Buneman, Davidson, et al.
- 1996
|
|
354
|
Data integration: a theoretical perspective
– Lenzerini
- 2002
|
|
351
|
Information integration using logical views
– Ullman
- 1997
|
|
318
|
Optimal implementation of conjunctive queries in relational databases
– Chandra, Merlin
- 1977
|
|
280
|
Answering Queries Using Views: A Survey
– Halevy
- 2001
|
|
209
|
Index structures for path expressions
– Milo, Suciu
- 1999
|
|
205
|
Adding Structure to Unstructured Data
– Buneman, Davidson, et al.
- 1997
|
|
137
|
Description logic framework for information integration
– Calvanese, Giacomo, et al.
- 1998
|
|
120
|
Data Management for Peer-to-Peer Computing: A Vision
– Bernstein, Giunchiglia, et al.
- 2002
|
|
115
|
Piazza: Data management infrastructure for semantic web applications
– Halevy, Ives, et al.
- 2003
|
|
114
|
On conjunctive queries containing inequalities
– Klug
- 1988
|
|
113
|
SilkRoute: Trading between relations and XML
– Fernandez, Tan, et al.
- 1999
|
|
104
|
Containment and Equivalence for an XPath Fragment
– Miklau, Suciu
|
|
100
|
Equivalence among relational expressions with the union and difference operators
– Sagiv, Yannakakis
- 1980
|
|
98
|
Z.G.: Schema mediation in peer data management systems
– Halevy, Suciu, et al.
|
|
95
|
Navigational plans for data integration
– Friedman, Levy, et al.
- 1999
|
|
84
|
Minimization of tree pattern queries
– Amer-Yahia, Cho, et al.
|
|
71
|
Queries independent of updates
– Levy, Sagiv
- 1993
|
|
67
|
Algorithms for acyclic database schemes
– Yannakakis
- 1981
|
|
65
|
Query containment for conjunctive queries with regular expressions
– Florescu, Levy, et al.
- 1998
|
|
65
|
PeerDB: A P2P-based System for Distributed Data Sharing
– Ng, Ooi, et al.
- 2003
|
|
64
|
On the equivalence of recursive and nonrecursive Datalog programs
– Chaudhuri, Vardi
- 1992
|
|
62
|
Constraint checking with partial information
– Gupta, Sagiv, et al.
- 1994
|
|
60
|
Using powerdomains to generalize relational databases, Theoretical Computer Science 91�1991
– Buneman, Jung, et al.
|
|
59
|
Equivalence of datalog queries is undecidable
– Shmueli
- 1993
|
|
59
|
Efficient Query Reformulation in Peer Data Management Systems
– Tatarinov, Halevy
|
|
58
|
R.J.: Mapping data in peer-to-peer systems: Semantics and algorithmic issues
– Kementseitsidis, Arenas, et al.
- 2003
|
|
57
|
Optimization of real conjunctive queries
– Chaudhuri, Vardi
- 1993
|
|
40
|
Deciding containment for queries with complex objects
– Levy, Suciu
- 1997
|
|
38
|
Equivalence of relational expressions
– Aho, Sagiv, et al.
- 1979
|
|
38
|
The complexity of querying indefinite data about linearly ordered domains
– Meyden
- 1992
|
|
32
|
Containment and integrity constraints for XPath
– Deutsch, Tannen
- 2001
|
|
23
|
Semantic Representations and Query Languages for Orsets
– Libkin, Wong
- 1993
|
|
21
|
On efficient reasoning with implication constraints
– Zhang, Özsoyoglu
|
|
16
|
Verifying integrity constraints on web-sites
– Fernandez, Florescu, et al.
- 1999
|
|
14
|
R.: Containment of Conjunctive Queries: Beyond Relations as Sets
– Ioannidis, Ramakrishnan
- 1995
|
|
10
|
Verification of knowledge bases using containment checking
– Levy, Rousset
- 1996
|
|
8
|
The verso algebra or how to answer queries with fewer joins
– Bidoit
- 1987
|
|
5
|
The nimble integration system
– Draper, Halevy, et al.
- 2001
|
|
1
|
liquid data for weblogic. www.bea.com/liquiddata
– Bea
|
|
1
|
Handbook of theoretical computer science: algorithms and complexity, volume B
– Gunter, Scott
- 1990
|
