Materializing Views with Minimal Size to Answer Queries

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 38-48

  Chirkova, Rada ^a   Li, Chen ^b  

^a North Carolina State University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA WAREHOUSES; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PROBLEM SOLVING; QUERY LANGUAGES;

DATA INTEGRATION; VIEWSETS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 1142299775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773158     Document Type: Conference Paper

References (37)

1. F. Afrati, C. Li, and J. D. Ullman. Generating efficient plans using views. In SIGMOD, pages 319-330, 2001.
2. S. Agrawal, S. Chaudhuri, and V. Narasayya. Automated selection of materialized views and indexes in Microsoft SQL Server. In Proc. of VLDB, pages 496-505, Cairo, Egypt, 2000.
3. E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in a multidimensional database. In Proc. of VLDB, 1997.
4. R. Bello, K. Dias, A. Downing, J. Feenan, J. Finnerty, W. Norcott, H. Sun, A. Witkowski, and M. Ziauddin. Materialized views in Oracle. In Proc. of VLDB, pages 659-664, 1998.
5. P. A. Bernstein, N. Goodman, E. Wong, C. L. Reeve, and J. B. R. Jr. Query processing in a system for distributed databases (SDD-1). ACM Transactions on Database Systems (TODS), 6(4):602-625, 1981.
6. D. Calvanese, G. D. Giacomo, and M. Lenzerini. Answering queries using views over description logics knowledge bases. In PODS, pages 386-391, July August 2000.
7. D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Answering regular path queries using views. In ICDE, pages 389-398, 2000.
8. S. Ceri and G. Pelagatti. Distributed Databases: Principles and Systems. McGraw-Hill Book Company, 1984.
9. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. STOC, pages 77-90, 1977.
10. Z. Chen and P. Seshadri. An algebraic compression framework for query results. In ICDE, pages 177-188, 2000.
11. R. Chirkova. The view-selection problem has an exponential-time lower bound for conjunctive queries and views. PODS, pages 159-168, 2002.
12. R. Chirkova and M. R. Genesereth. Linearly bounded reformulations of conjunctive databases. DOOD, 2000.
13. R. Chirkova, A. Y. Halevy, and D. Suciu. A formal perspective on the view selection problem. Proc. of VLDB, pages 59-68, 2001.
14. J. Goldstein and P.-A. Larson. Optimizing queries using materialized views: a practical, scalable solution. In SIGMOD, pages 331-342, 2001.
15. H. Gupta. Selection of views to materialize in a data warehouse. In ICDT, 1997.
16. H. Gupta, V. Harinarayan, A. Rajaraman, and J. Ullman. Index selection in olap. In ICDE, 1997.
17. L. M. Haas, D. Kossmann, E. L. Wimmers, and J. Yang. Optimizing queries across diverse data sources. In Proc. of VLDB, pages 276-285, 1997.
18. H. Hacigümüş, B. Iyer, C. Li, and S. Mehrotra. Executing SQL over encrypted data in the database-service-provider model. In SIGMOD, 2002.
19. H. Hacigümüş, B. Iyer, and S. Mehrotra. Providing database as a service. In ICDE, 2002.
20. A. Halevy. Answering queries using views: A survey. In Very Large Database Journal, 2001.
21. V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing data cubes efficiently. In SIGMOD, 1996.
22. M. Lenzerini. Data integration: A theoretical perspective. In PODS, pages 233-246, 2002.
23. A. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, pages 95-104, 1995.
24. C. Li, M. Bawa, and J. D. Ullman. Minimizing view sets without losing query-answering power. In ICDT, pages 99-113, 2001.
25. J. Li, R. Chirkova, and C. Li. Minimizing data-communication costs by decomposing query results in client-server environments. Technical report, Information and Computer Science, UC Irvine, 2003.
26. M. T. Özsu and P. Valduriez. Principles of Distributed Database Systems. Prentice-Hall, 1999.
27. R. Pottinger and A. Levy. A scalable algorithm for answering queries using views. In Proc. of VLDB, 2000.
28. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633-655, 1980.
29. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In SIGMOD, pages 23-34, 1979.
30. D. Theodoratos, S. Ligoudistianos, and T. Sellis. Designing the global data warehouse with spj views. In CAiSE, 1999.
31. D. Theodoratos and T. Sellis. Data warehouse configuration. In Proc. of VLDB, 1997.
32. TPC-H. http://www.tpc.org/tpch/.
33. J. D. Ullman. Principles of Database and Knowledge-base Systems, Volumes I: Classical Database Systems. Computer Science Press, New York, 1988.
34. G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):38-49, 1992.
35. J. Yang, K. Karlapalem, and Q. Li. Algorithms for materialized view design in data warehousing environment. In Proc. of VLDB, 1997.
36. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB, pages 82-94. IEEE Computer Society Press, 1981.
37. M. Zaharioudakis, R. Cochrane, G. Lapis, H. Pirahesh, and M. Urata. Answering complex SQL queries using automatic summary tables. In SIGMOD, pages 105-116, 2000.