Abstract
Recently, multi-query optimization techniques have been considered as beneficial in view selection setting. The main interest of such techniques relies in detecting common sub expressions between the different queries of workload. This feature can be exploited for sharing updates and space storage. However, due to the reuse a query change may entail an important reorganization of the multi query graph. In this paper, we present an approach that is based on multi-query optimization for view selection and that attempts to reduce the drawbacks resulting from these techniques. Finally, we present a performance study using workloads consisting of queries over the schema of the TPC-H benchmark. This study shows that our view selection provides significant benefits over the other approaches.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
S. Agrawal, S. Chaudhury, and V. Narasayya. Automated Selection of Materialized Views and Indexes for SQL Databases. In Proceedings of the 26th International Conference on Very Large Databases, VLDB’2000, Cairo, Egypt, 2000.
Z. Bellahsène and P. Marot. Materializing a Set of Views: Dynamic Strategies and Performance Evaluation. In Proceedings of International Database Engineering and Applications Symposium, Yokohoma, Japan, September 2000. IEEE publishing.
R. Chirkova, A. Halevy, and D. Suciu. A formal perspective on the view selection problem. In Proceedings of the 27th International Conference on Very Large Databases, VLDB’2001, Roma, Italy, September 2001.
H. Gupta. Selection of Views to Materialize in a DataWarehouse. In Proceedings of the International Conference on Database Theory, Delphi, Greece, January 1997.
H. Gupta and I. Mumick. Selection of Views to Materialize Under a Maintenance-Time Constraint. In Proceedings of the International Conference on Database Theory, Jerusalem, Israel, January 1999.
Y. Kotidis and N. Roussopoulos. DynaMat: A Dynamic View Management System for Data Warehouses. In Proceedings of the ACM SIGMOD Conference, Philadelphia, USA, 1999.
H. Mistry, P. Roy, and K. Ramamritham. Materialized View Selection and Maintenance Using Multi-Query Optimization. In Proceeding of the International Conference on Management of Data SIGMOD, USA, 2001.
P. Roy, S Seshadri, S. Sudarshan, and B. Siddhesh. Efficient and Extensible Algorithms for Multiquery Optimization. In Proceeding of the International Conference on Management of Data SIGMOD, San Diego, USA, 2000.
D. Theodoratos and T. Sellis. Data warehouse configuration. In In Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB’1997, 1997.
D. Theodoratos and T. Sellis. Incremental Design. Journal of Intelligent Information Systems, 15: 7–27, 2000.
TPC-R Benchmark Standard Specification 2.01, January 1999. http://www.tpc.org.
J. Yang, K. Karlapalem, and Q. Li. Algorithm for Materialized View Design in data Warehousing Environment. In Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB’1997, pages 136–145, Athens, Greece, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baril, X., Bellahséne, Z. (2003). Selection of Materialized Views: A Cost-Based Approach. In: Eder, J., Missikoff, M. (eds) Advanced Information Systems Engineering. CAiSE 2003. Lecture Notes in Computer Science, vol 2681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45017-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-45017-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40442-2
Online ISBN: 978-3-540-45017-7
eBook Packages: Springer Book Archive