ACM Home Page
Please provide us with feedback. Feedback
Theory of answering queries using views
Full text PdfPdf (863 KB)
Source ACM SIGMOD Record archive
Volume 29 ,  Issue 4  (December 2000) table of contents
Pages: 40 - 47  
Year of Publication: 2000
ISSN:0163-5808
Author
Alon Y. Halevy  Department of Computer Science and Engineering, University of Washington, Seattle, WA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 36,   Citation Count: 28
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/369275.369284
What is a DOI?

ABSTRACT

The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a wide variety of data management problems, such as query optimization, the maintenance of physical data independence, data integration and data warehousing. This article surveys the theoretical issues concerning the problem of answering queries using views.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
[2] Serge Abiteboul, Peter Buneman, and Dan Suciu. Data on the Web. Morgan Kaufmann, 1999.
 
3
[3] Foto Afrati. Personal communication, 2000.
 
4
 
5
6
 
7
 
8
9
 
10
11
 
12
[12] Diego Calvanese, Giuseppe De Giacorno, and Maurizio Lenzerini. Answering queries using views in description logics. In Working notes of the KRDB Workshop, 1999.
13
 
14
 
15
[15] Rada Chirkova and Michael Genesereth. Linearly bounded reformulations of conjunctive databases. In Proc. of DOOD, 2000.
16
 
17
 
18
[18] Jan Van den Bussche. Two remarks on the complexity of answering queries using views. To appear in Information Processing Letters, 2000.
 
19
 
20
[20] Oliver Duschka, Michael Genesereth, and Alon Levy. Recursive query plans for data integration, newblock Journal of Logic Programming, 43(1):49-73, 2000.
 
21
22
 
23
 
24
[24] Daniela D. Florescu. Search Spaces for Object-Oriented Query Optimization. PhD thesis, Univerisity of Paris VI, France, 1996.
 
25
[25] M. Friedman and D. Weld. Efficient execution of information gathering plans. In Proceedings of the International Joint Conference on Artificial Intelligence, Nagoya, Japan, 1997.
 
26
27
28
 
29
 
30
31
32
 
33
[33] Chung T. Kwok and Daniel S. Weld. Planning to gather information. In Proceedings of the AAAI Thirteenth National Conference on Artificial Intelligence, 1996.
 
34
35
 
36
37
38
39
40
 
41
42
 
43
 
44
 
45
46

CITED BY  28