Abstract
The maintenance-cost view-selection problem is one of the important issues in data warehouse design. It is to select a set of materialized views under a maintenance cost constraint (such as maintenance time), in order to minimize the total query processing cost for a given set of queries. The problem has recently received significant attention. Several greedy/heuristic algorithms were proposed. However, the quality of the greedy/heuristic algorithms has not been well analyzed. In this paper, in a multidimensional data warehouse environment, we reexamine the greedy/heuristic algorithms in various settings, and provide users with insights on the quality of these heuristic algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Elena Baralis and Stefano Paraboschi and Ernest Teniente: Materialized Views Selection in a Multidimensional Database. Proceedings of 23rd International Conference on Very Large Data Bases (1997) 156–165
Himanshu Gupta and Venky Harinarayan and Anand Rajaraman and Jeffrey D. Ullman: Index Selection for OLAP. Proceedings of the Thirteenth International Conference on Data Engineering (1997) 208–219
H. Gabow: Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs. Stanford University (1973)
Ashish Gupta and Inderpal Singh Mumick: Materialized Views: Techniques, Implementations, and Applications. The MIT Press (1999)
Himanshu Gupta and Inderpal Singh Mumick: Selection of Views to Materialize Under a Maintenance Cost Constraint. Proceedings of the 7th International Conference on Database Theory (1999) 453–470
Himanshu Gupta: Selection of Views to Materialize in a Data Warehouse. Proceedings of the 6th International Conference on Database Theory (1997) 98–112
Venky Harinarayan and Anand Rajaraman and Jeffrey D. Ullman: Implementing Data Cubes Efficiently. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (1996) 205–216
R. Kimball: The Data Warehouse Toolkit. John Wiley & Sons (1996)
Weifa Liang and Hui Wang and Maria E. Orlowska: Materialized view selection under the maintenance time constraint. Proc. of DKE01 (2001)
Amit Shukla and Prasad Deshpande and Jeffrey F. Naughton: Materialized View Selection for Multidimensional Datasets. Proceedings of 24rd International Conference on Very Large Data Bases (1998) 488–499
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, CH., Yu, J.X., Gou, G. (2002). What Difference Heuristics Make: Maintenance-Cost View-Selection Revisited. In: Meng, X., Su, J., Wang, Y. (eds) Advances in Web-Age Information Management. WAIM 2002. Lecture Notes in Computer Science, vol 2419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45703-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-45703-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44045-1
Online ISBN: 978-3-540-45703-9
eBook Packages: Springer Book Archive