Article

Free access

Complexity of answering queries using materialized views

Authors:

Serge Abiteboul,

Oliver M. DuschkaAuthors Info & Claims

PODS '98: Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 254 - 263

https://doi.org/10.1145/275487.275516

Published: 01 May 1998 Publication History

PDF eReader

References

[1]

S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

Google Scholar

[2]

S. Abiteboul, P. Kanellakis, G. Grahne. On the representation and querying of sets of possible worlds. TCS, 78(I):159- 187, 1991.

Digital Library

Google Scholar

[3]

A. V. Aho, Y. Sagiv, J. D. Ullman. Ettieient optimiziation of a class of relational expressions. ACM TODS, 4(4):435--454, 1979.

Digital Library

Google Scholar

[4]

A. V. Aho, Y. Sagiv, L D. Ullman. Equivalences among relational expressions. SIAM J. on Computing, 8(3):218-246, 1979.

Digital Library

Google Scholar

[5]

C. Beeri, A. Y. Levy, M.-C. Rousset. Rewriting queries using views in description logics. In PODS-97, pp. 99 - 108, 1997.

Digital Library

Google Scholar

[6]

S. Chaudhuri, R. Krishnamurthy, S. Potamianos, K. Shim. Optimizing queries with materialized views. In ICDE,.95, pp. 190-200, 1995.

Digital Library

Google Scholar

[7]

A. IC Chandra, P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. InACM STOC, pp. 77-90, 1977.

Digital Library

Google Scholar

[8]

S.A. Cook. The complexity of theorem proving procedures. InACMSTOCS, pp. 151- 158, 1971.

Digital Library

Google Scholar

[9]

S. Chaudhuri, M. Y. Vardi. On the equivalence ofreeursive and nonreeursive datalog programs. In PODS-92, pp. 55-66.

Digital Library

Google Scholar

[10]

O. M. Duschka, M. R. Genesereth. Answering reeursive queries using views. In PODS-97, pp. 109 - 116.

Digital Library

Google Scholar

[11]

O. M. Duschka, M. R. Genesereth. Query planning in Infomaster. In ACM SAC, 1997.

Digital Library

Google Scholar

[12]

O.M. Dusehka, A. Y. Levy. Reeursive plans for information gathering. In IJCAI-97.

Google Scholar

[13]

G. Dong, J. Su. Conjunctive query containment with respect to views and constraints. IPL, 57(2):95-102, 1996.

Digital Library

Google Scholar

[14]

O. M. Dusehka. Query optimization using local completeness. InAAAI-97, pp. 249-255.

Digital Library

Google Scholar

[15]

H.-D. Ebbinghaus, L Flum. Finite model theory. Springer-Verlag, 1995.

Crossref

Google Scholar

[16]

H. B. Enderton. A mathematical introduction to logic. Academic Press, Inc., 1972.

Google Scholar

[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.

Crossref

Google Scholar

[18]

G. Grahne, Problem of incomplete information in relational databases. Springer-Vedag, 1991.

Digital Library

Google Scholar

[19]

N, Huyn. Maintaining data warehouses under limited Bouree access. Ph.D. Thesis STAN-CS-TR-97-1595, Stanford University, 1997.

Digital Library

Google Scholar

[20]

T. Imielinski, W. Lipski Jr. Incomplete information in relational databases. J. ACM, 3 I(4):761-791, 1984.

Digital Library

Google Scholar

[21]

D. S. Johnson, A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies, JCSS, 28' 167-189, 1984.

Crossref

Google Scholar

[22]

R. M, Karp. Reducibility among combinatorial problems, Complexity of Computer Computations, pp. 85- 104, 1972.

Crossref

Google Scholar

[23]

A. Klug. On conjunctive queries containing inequalities, J. ACM, 35(1):146-160, 1988.

Digital Library

Google Scholar

[24]

A, Y. Levy, A. O. Mendelzon, D. Srivastava, Y. Sagiv. Answering queries using views. In PODS-95.

Digital Library

Google Scholar

[25]

A. Y. Levy, A. Rajaraman, J. J. Ordille. Querying heterogeneous information sources using source descriptions, In VLDB-96, pp. 251-262.

Digital Library

Google Scholar

[26]

A, Y, Levy, A. Rajaraman, J. D. Ullman. Answering queries using limited external processors. In PODS-96.

Digital Library

Google Scholar

[27]

A. Y. Levy, D. Sueiu. Deciding containment for queries with complex objects. In PODS-97, pp. 32 - 43.

Digital Library

Google Scholar

[28]

W, J. Labio, Y. Zhuge, J. L. Wiener, H. Gupta, H. Gareia-Molina, L Widom. The WHIPS prototype for data warehouse creation and maintenance. In SIGMOD Conf., pp. 557- 559, 1997.

Digital Library

Google Scholar

[29]

E, Post, A variant of a reeursively unsolvable problem. Bulletin AMS, 52:264-268, 1946.

Crossref

Google Scholar

[30]

A. Rajaraman, Y. Sagiv, J. D. Ullman. Answering queries using templates with binding patterns. In POD~.95,

Digital Library

Google Scholar

[31]

O. Shmueli, Decidability and expressiveness aspects of logic queries, in PODS-87, pp. 237 - 249.

Digital Library

Google Scholar

[32]

O. Shmueli. Equivalence ofdatalog queries is undeeidable. ~ Logic Programming, 15:231-241, 1993.

Digital Library

Google Scholar

[33]

Y. Sagiv, M, Yannakakis. Equivaleneeamong relational expressions with the union and difference operators. I ACM, 27(4):633-655, 1980.

Digital Library

Google Scholar

[34]

J', D, Ullman. Principles of Database and Knowledgebase Systems, vol. 1. Computer Science Press, 1988.

Digital Library

Google Scholar

[35]

J, D. Ullman, Principles of Database and Knowledgebase Systems, vol. 2. Computer Science Press, 1989.

Digital Library

Google Scholar

[36]

J. D. Ullman. Information integration using logical views. In ICDT.97.

Digital Library

Google Scholar

[37]

M. Y, Vardi. The complexity of relational query languages. In STOC-82, pp. 137- 146.

Digital Library

Google Scholar

[38]

M. Y, Vardi. Querying logical databases JCSS, 33(2):142-160, I986.

Digital Library

Google Scholar

[39]

M. Y. Vardi. Fundamentals of dependency theory. In E. Borger, editor, Trends in Theoretical Computer Science, pp. 171- 224. Computer Science Press, 1987.

Google Scholar

[40]

R. van tier Meyden. The complexity of querying indefinite information: Defined relations, reeursion and linear order. Technical report, Rutgers University, 1992.

Google Scholar

[41]

R. van der Meyden. Reeursively indefinite databases. TCS, 116(1):151-194, 1993.

Digital Library

Google Scholar

[42]

R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. JCSS, 54(1):113- 135, 1997.

Digital Library

Google Scholar

[43]

H. Z. Yang, P.-.~,. Larson. Query transformation for PSJ-queries. In VLDB-87, pp. 245-254.

Digital Library

Google Scholar

Cited By

View all

Alsudais SKumar ALi C(2023)RavenProceedings of the Workshop on Human-In-the-Loop Data Analytics10.1145/3597465.3605219(1-7)Online publication date: 18-Jun-2023
Niu XGlavic BLiu ZLi PGawlick DKrishnaswamy VLiu ZPorobic D(2022)Provenance-based data skippingProceedings of the VLDB Endowment10.14778/3494124.349413015:3(451-464)Online publication date: 4-Feb-2022
Afrati FChirkova R(2022)Answering Queries Using Views, Second EditionundefinedOnline publication date: 26-Feb-2022
Show More Cited By

Index Terms

Complexity of answering queries using materialized views
1. Information systems
  1. Data management systems
  2. Information systems applications
    1. Decision support systems
      1. Data warehouses
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)
      2. Database query processing and optimization (theory)

Recommendations

Answering XML queries using materialized views revisited
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge management

Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whether a query can be answered exclusively using one or multiple materialized ...
Answering Queries Using Materialized Views with Disjunctions
ICDT '99: Proceedings of the 7th International Conference on Database Theory

We consider the problem of answering datalog queries using materialized views. More specifically, queries are rewritten to refer to views instead of the base relations over which the queries were originally written. Much work has been done on program ...
Materialized views selection for answering queries
ICDEM'10: Proceedings of the Second international conference on Data Engineering and Management

A data warehouse stores historical data to support analytical query processing. These analytical queries are long and complex and processing these against a large data warehouse consumes a lot of time. As a result, the query response time is high. One ...

Comments

Information & Contributors

Information

Published In

PODS '98: Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

May 1998

286 pages

ISBN:0897919963

DOI:10.1145/275487

Chairmen:
Alberto Mendelson
Univ. of Toronto
,
Jan Paredaens
Univ. of Antwerp

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS98

Sponsor:

SIGMOD/PODS98: Special Interest Group on Management of Data

June 1 - 4, 1998

Washington, Seattle, USA

Acceptance Rates

PODS '98 Paper Acceptance Rate 28 of 119 submissions, 24%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

320
Total Citations
View Citations
1,704
Total Downloads

Downloads (Last 12 months)73
Downloads (Last 6 weeks)6

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Alsudais SKumar ALi C(2023)RavenProceedings of the Workshop on Human-In-the-Loop Data Analytics10.1145/3597465.3605219(1-7)Online publication date: 18-Jun-2023
Niu XGlavic BLiu ZLi PGawlick DKrishnaswamy VLiu ZPorobic D(2022)Provenance-based data skippingProceedings of the VLDB Endowment10.14778/3494124.349413015:3(451-464)Online publication date: 4-Feb-2022
Afrati FChirkova R(2022)Answering Queries Using Views, Second EditionundefinedOnline publication date: 26-Feb-2022
Dong XSrivastava D(2022)Big Data IntegrationundefinedOnline publication date: 23-Feb-2022
Ng RArocena PBarbosa DCarenini GGomes LJou SLeung RMilios EMiller RMylopoulos JPottinger RTompa FYu E(2022)Perspectives on Business IntelligenceundefinedOnline publication date: 25-Feb-2022
Fan WGeerts F(2022)Foundations of Data Quality ManagementundefinedOnline publication date: 2-Mar-2022
Aberer K(2022)Peer-to-Peer Data ManagementundefinedOnline publication date: 25-Feb-2022
Genesereth M(2022)Data IntegrationundefinedOnline publication date: 11-Mar-2022
Benedikt MBourhis PCate BPuppis GBoom M(2021)Inference from Visible Information and Background KnowledgeACM Transactions on Computational Logic10.1145/345291922:2(1-69)Online publication date: 21-Jun-2021
Console MHofer MLibkin LSuciu DTao YWei Z(2020)Queries with Arithmetic on Incomplete DatabasesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387666(179-189)Online publication date: 14-Jun-2020
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Answering XML queries using materialized views revisited

Answering Queries Using Materialized Views with Disjunctions

Materialized views selection for answering queries