by Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman
In Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
http://www.cs.washington.edu/homes/alon/site/files/pods96.ps
Add To MetaCart
Abstract:
When answering queries using external information sources, their contents can be described by views. To answer a query, we must rewrite it using the set of views presented by the sources. When the external information sources also have the ability to answer some (perhaps limited) sets of queries that require performing operations on their data, the set of views presented by the source may be infinite (albeit encoded in some finite fasion). Previous work on answering queries using views has only considered the case where the set of views is finite. In order to exploit the ability of information sources to answer more complex queries, we consider the problem of answering conjunctive queries using infinite sets of views. Our first result is that an infinite set of views can be partitioned into a finite number of equivalence classes, such that picking one view from every nonempty class is sufficient to determine whether the query can be answered using the views. Second, we show how to compute the set of equivalence classes for sets of views encoded by a datalog program. Furthermore, we extend our results to the case when the query and the views use the built-in predicates!,, =, and 6=, and they are interpreted over a dense domain. Finally, we extend our results to conjunctive queries and views with the built-in predicates!, , and = interpreted over the integers. In doing so we present a result of independent interest, namely, an algorithm to minimize such queries.
Citations
|
603
|
Querying heterogeneous information sources using source description
– Levy, Rajamaran, et al.
- 1996
|
|
389
|
Answering Queries using Views
– Levy, Mendelzon, et al.
- 1995
|
|
344
|
Information Integration Using Logical Views
– Ullman
- 1997
|
|
313
|
Optimal Implementation of Conjunctive Queries in relational Databases
– Chandra, Merlin
- 1977
|
|
299
|
Retrieving and Integrating Data from Multiple Information Sources
– Arens, Chee, et al.
- 1993
|
|
273
|
A softbot-based interface to the Internet
– Etzioni, Weld
- 1994
|
|
235
|
Query reformulation for dynamic information integration
– Arens, Knoblock, et al.
- 1996
|
|
216
|
Optimizing queries with materialized views
– Chaudhuri, Krishnamurthy, et al.
- 1995
|
|
211
|
Data Model and Query Evaluation in Global Information systems
– Levy, Srivastava, et al.
- 1995
|
|
181
|
Answering queries using templates with binding patterns
– Rajaraman, Sagiv, et al.
- 1995
|
|
178
|
Query caching and optimization in distributed mediator systems
– Adali, Candan, et al.
- 1996
|
|
177
|
Sleepers and workaholics: Caching strategies in mobile environments
– Barbara, Imielinski
- 1994
|
|
128
|
Query folding
– Qian
- 1996
|
|
116
|
A Query Translation Scheme for Rapid Implementation of Wrappers
– Papakonstantinou
- 1995
|
|
111
|
On conjunctive queries containing inequalities
– Klug
- 1988
|
|
94
|
Query transformation for PSJ-queries
– Yang, Larson
- 1987
|
|
77
|
Y.Papakonstantinou, Describing and Using Query Capabilities of Heterogeneous Sources
– Vassalos
- 1997
|
|
73
|
The GMAP: A versatile tool for physical data independence
– Tsatalos, Solomon, et al.
- 1996
|
|
70
|
Ordille,“Query Answering Algorithms for Information Agents
– Levy, Rajaraman, et al.
- 1996
|
|
64
|
Adapting Materialized Views After Redefinitions
– Gupta, Mumick, et al.
- 1995
|
|
62
|
Data replication for mobile computers
– Huang, Sistla, et al.
- 1994
|
|
61
|
Constraint checking with partial information
– Gupta, Sagiv, et al.
- 1994
|
|
54
|
Query Planning in Infomaster
– Duschka, Genesereth
- 1997
|
|
37
|
The complexity of querying indefinite data about linearly ordered domains
– Meyden
- 1992
|
|
35
|
Constraints and redundancy in Datalog
– Levy, Sagiv
- 1992
|
|
34
|
Efficient execution of information gathering plans
– Friedman, Weld
- 1997
|
|
28
|
and Yehoshua Sagiv. Queries independent of updates
– Levy
- 1993
|
|
21
|
On efficient reasoning with implication constraints
– Zhang, Özsoyoglu
|
|
11
|
Shuky Sagiv. Speeding up inferences using relevance reasoning: A formalism and algorithms
– Levy, Fikes
- 1997
|
|
10
|
The Complexity of Querying Indefinite Information: Defined Relations Recursion and Linear Order
– Meyden
- 1992
|