Abstract
The materialization of fragmented views in data warehouses has the objective of improving the system response time for a given workload. It represents a combinatorial optimization problem arising in the logical design of data warehouses which has so far received little attention from the optimization community. This paper describes the application of a metaheuristic approach, namely the ANTS approach, to this problem. In particular, we propose an integer programming formulation of the problem, derive an efficient lower bound and embed it in an ANTS algorithm. Preliminary computational results, obtained on the well-known TPC-D benchmark, are presented.
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
D. Munneke, K. Wahlstrom, and M. Mohania. Fragmentation of multidimensional databases. In Proc. 10th Australasian Database Conf., pages 153–64, 1999.
A. Datta, B. Moon, and H. Thomas. A case for parallelism in data warehousing and OLAP. In Proc. IEEE First Int. Workshop on Data Warehouse Design and OLAP Technology, 1998.
M. Golfarelli, D. Maio, and Rizzi S. Applying vertical fragmentation techniques in logical design of multidimensional databases. In Proceedings of 2nd International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2000), pages 11–23, 2000.
R. Kimball. The data warehouse toolkit. John Wiley & Sons, 1996.
M. Golfarelli and S. Rizzi. Designing the data warehouse: key steps and crucial issues. J. of Computer Science and Information Management, 2(3), 1999.
F. Raab, editor. TPC Benchmark(tm) D (Decision Support), Proposed Revision 1.0. Transaction Processing Performance Council, San Jose, 1995.
E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in multidimensional database. In Proc. 23rd VLDB, pages 156–65, 1997.
V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing Data Cubes Efficiently. In Proc. ACM Sigmod Conf., 1996.
J. Yang, K. Karlaplem, and Q. Li. Algorithms for Materialized View Design in Data Warehousing Environments. In Proc. 23rd VLDB, pages 136–45, 1997.
V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. on Computing, 11(4):358–69, 1999.
A. Colorni, M. Dorigo, and V. Maniezzo. Distributed optimization by ant colonies. In Proc. ECAL’91, European Conference on Artificial Life. Elsevier, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maniezzo, V., Carbonaro, A., Golfarelli, M., Rizzi, S. (2001). An ANTS Algorithm for Optimizing the Materialization of Fragmented Views in Data Warehouses: Preliminary Results. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-45365-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41920-4
Online ISBN: 978-3-540-45365-9
eBook Packages: Springer Book Archive