Skip to main content

Selecting and Using Views to Compute Aggregate Queries

(Extended Abstract)

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3363))

Abstract

We consider a workload of aggregate queries and investigate the problem of selecting views that (1) provide equivalent rewritings for all queries, and (2) are optimal, in that the cost of evaluating the query workload is minimized. We consider conjunctive views and rewritings, with or without aggregation; in each rewriting, only one view contributes to computing the aggregated query output. We look at query rewriting using existing views and at view selection. In the query-rewriting problem, we give su.cient and necessary conditions for a rewriting to exist. For view selection, we prove complexity results. Finally, we give algorithms for obtaining rewritings and selecting views.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing data cubes efficiently. In: Proceedings of SIGMOD, pp. 205–216 (1996)

    Google Scholar 

  2. Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.: Index selection for OLAP. In: Proceedings of ICDE, pp. 208–219 (1997)

    Google Scholar 

  3. Agrawal, S., Chaudhuri, S., Narasayya, V.: Automated selection of materialized views and indexes in SQL databases. In: Proceedings of VLDB, pp. 496–505 (2000)

    Google Scholar 

  4. Ullman, J.D.: Efficient implementation of data cubes via materialized views. In: Proceedings of KDD, pp. 386–388 (1996)

    Google Scholar 

  5. Chirkova, R., Halevy, A., Suciu, D.: A formal perspective on the view selection problem. VLDB Journal 11, 216–237 (2002)

    Article  MATH  Google Scholar 

  6. Gupta, A., Harinarayan, V., Quass, D.: Aggregate-query processing in data warehousing environments. In: Proceedings of VLDB, pp. 358–369 (1995)

    Google Scholar 

  7. Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M.: Data cube: A relational aggregation operator generalizing Group-by, Cross-Tab, and Sub Totals. Data Mining and Knowledge Discovery 1, 29–53 (1997)

    Article  Google Scholar 

  8. Cohen, S., Nutt, W., Serebrenik, A.: Rewriting aggregate queries using views. In: Proceedings of PODS, pp. 155–166 (1999)

    Google Scholar 

  9. Cohen, S., Nutt, W., Serebrenik, A.: Algorithms for rewriting aggregate queries using views. In: Proceedings of ADBIS-DASFAA, pp. 65–78 (2000)

    Google Scholar 

  10. Widom, J.: Research problems in data warehousing. In: Proceedings of CIKM (1995)

    Google Scholar 

  11. Srivastava, D., Dar, S., Jagadish, H., Levy, A.: Answering queries with aggregation using views. In: Proceedings of VLDB, pp. 318–329 (1996)

    Google Scholar 

  12. Grumbach, S., Tininini, L.: On the content of materialized aggregate views. Journal of Computer and System Sciences 66, 133–168 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Agarwal, S., Agrawal, R., Deshpande, P., Gupta, A., Naughton, J., Ramakrishnan, R., Sarawagi, S.: On the computation of multidimensional aggregates. In: Proceedings of VLDB, pp. 506–521 (1996)

    Google Scholar 

  14. Yang, J., Widom, J.: Incremental computation and maintenance of temporal aggregates. In: Proceedings of ICDE, pp. 51–62 (2001)

    Google Scholar 

  15. Benedikt, M., Libkin, L.: Aggregate operators in constraint query languages. Journal of Computer and System Sciences 64, 628–654 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ross, K., Srivastava, D., Stuckey, P., Sudarshan, S.: Foundations of aggregation constraints. Theoretical Computer Science 193, 149–179 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Özsoyoglu, G., Özsoyoglu, Z., Matos, V.: Extending relational algebra and relational calculus with set-valued attributes and aggregate functions. ACM Transactions on Database Systems (TODS) 12, 566–592 (1987)

    Article  Google Scholar 

  18. Lechtenbörger, J., Shu, H., Vossen, G.: Aggregate queries over conditional tables. Journal of Intelligent Information Systems 19, 343–362 (2002)

    Article  Google Scholar 

  19. Nutt, W., Sagiv, Y., Shurin, S.: Deciding equivalences among aggregate queries. In: Proceedings of PODS, pp. 214–223 (1998)

    Google Scholar 

  20. Chaudhuri, S., Vardi, M.: Optimization of real conjunctive queries. In: Proceedings of PODS, pp. 59–70 (1993)

    Google Scholar 

  21. Ullman, J.D.: Information integration using logical views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186. Springer, Heidelberg (1996)

    Google Scholar 

  22. Afrati, F., Chirkova, R.: Selecting and using views to compute aggregate queries (2004), http://www4.ncsu.edu/~rychirko/Papers/aggregAquv.pdf

  23. Afrati, F., Li, C., Ullman, J.: Generating efficient plans for queries using views. In: Proceedings of SIGMOD (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Afrati, F., Chirkova, R. (2004). Selecting and Using Views to Compute Aggregate Queries. In: Eiter, T., Libkin, L. (eds) Database Theory - ICDT 2005. ICDT 2005. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30570-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30570-5_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24288-8

  • Online ISBN: 978-3-540-30570-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics