ACM Home Page
Please provide us with feedback. Feedback
Complexity of answering queries using materialized views
Full text PdfPdf (1.20 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Seattle, Washington, United States
Pages: 254 - 263  
Year of Publication: 1998
ISBN:0-89791-996-3
Authors
Serge Abiteboul  INRIA-Rocquencourt, Stanford University
Oliver M. Duschka  Socratix Systems, Inc., Stanford University
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 37,   Downloads (12 Months): 148,   Citation Count: 117
Additional Information:

references   cited by   index terms   collaborative colleagues  

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

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
3
 
4
A. V. Aho, Y. Sagiv, L D. Ullman. Equivalences among relational expressions. SIAM J. on Computing, 8(3):218-246, 1979.
5
 
6
7
8
9
10
11
 
12
O.M. Dusehka, A. Y. Levy. Reeursive plans for information gathering. In IJCAI-97.
 
13
 
14
O. M. Dusehka. Query optimization using local completeness. InAAAI-97, pp. 249-255.
 
15
H.-D. Ebbinghaus, L Flum. Finite model theory. Springer-Verlag, 1995.
 
16
H. B. Enderton. A mathematical introduction to logic. Academic Press, Inc., 1972.
 
17
R. Fagin, M. Y. Vardi. The theory of data dependencies: A survey. In M. Anshel and W. Gewirtz, editors, Mathematics of lnformation Processing: Proceedings of Symposia in Applied Mathematics, vol. 34, pp. 19 - 71, 1986.
 
18
 
19
20
 
21
D. S. Johnson, A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies, JCSS, 28' 167-189, 1984.
 
22
R. M, Karp. Reducibility among combinatorial problems, Complexity of Computer Computations, pp. 85- 104, 1972.
23
24
 
25
26
27
28
 
29
E, Post, A variant of a reeursively unsolvable problem. Bulletin AMS, 52:264-268, 1946.
30
31
 
32
33
 
34
 
35
 
36
37
 
38
 
39
M. Y. Vardi. Fundamentals of dependency theory. In E. Borger, editor, Trends in Theoretical Computer Science, pp. 171- 224. Computer Science Press, 1987.
 
40
R. van tier Meyden. The complexity of querying indefinite information: Defined relations, reeursion and linear order. Technical report, Rutgers University, 1992.
 
41
 
42
 
43

CITED BY  117

Collaborative Colleagues:
Serge Abiteboul: colleagues
Oliver M. Duschka: colleagues