Abstract
OLAP systems depend heavily on the materialization of multidimensional structures to speed-up queries, whose appropriate selection constitutes the cube selection problem. However, the recently proposed distribution of OLAP structures emerges to answer new globalization’s requirements, capturing the known advantages of distributed databases. But this hardens the search for solutions, especially due to the inherent heterogeneity, imposing an extra characteristic of the algorithm that must be used: adaptability. Here the emerging concept known as hyper-heuristic can be a solution. In fact, having an algorithm where several (meta-)heuristics may be selected under the control of a heuristic has an intrinsic adaptive behavior. This paper presents a hyper-heuristic polymorphic algorithm used to solve the extended cube selection and allocation problem generated in M-OLAP architectures.
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
Bauer, A., Lehner, W.: On Solving the View Selection Problem in Distributed Data Warehouse Architectures. In: Proceedings of the 15th International Conference on Scientific and Statistical Database Management (SSDBM’03), pp. 43–51. IEEE, Los Alamitos (2003)
Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-Heuristics: An Emerging Direction in Modern Search Technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-Heuristics, pp. 457–474. Kluwer, Dordrecht (2003)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing Data Cubes Efficiently. In: Proceedings of ACM SIGMOD, Montreal, Canada, pp. 205–216 (1996)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 2nd edn. MIT Press, Cambridge (1992)
Kalnis, P., Mamoulis, N., Papadias, D.: View Selection Using Randomized Search. Data Knowledge Engineering 42(1), 89–111 (2002)
Kennedy, J., Eberhart, R.C.: A Discrete Binary Version of the Particle Swarm Optimization Algorithm. In: Proc. of the 1997 Conference on Systems, Man and Cybernetics (SMC’97), pp. 4104–4109 (1997)
Lin, W.-Y., Kuo, I.-C.: Genetic Selection Algorithm for OLAP Data Cubes. Knowledge and Information Systems 6(1), 83–102 (2004)
Loureiro, J., Belo, O.: A Discrete Particle Swarm Algorithm for OLAP Data Cube Selection. In: Proc. of the 8th International Conference on Enterprise Information Systems (ICEIS 2006), Paphos – Cyprus, May 23-27, pp. 46–53 (2006)
Loureiro, J., Belo, O.: Evaluating Maintenance Cost Computing Algorithms for Multi-Node OLAP Systems. In: Proceedings of the XI Conference on Software Engineering and Databases (JISBD 2006), Sitges, Barcelona, October 3-6, pp. 241–250 (2006)
Loureiro, J., Belo, O.: An Evolutionary Approach to the Selection and Allocation of Distributed Cubes. In: Proceedings of 2006 International Database Engineering & Applications Symposium (IDEAS 2006), Delhi, India, December 11-14, pp. 243–248 (2006)
Moscato, P.: Memetic Algorithms: A Short Introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, ch.14, pp. 219–234. McGraw-Hill, London (1999)
Transaction Processing Performance Council (TPC): TPC Benchmark R (decision support) Standard Specification Revision 2.1.0. tpcr_2.1.0.pdf, http://www.tpc.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loureiro, J., Belo, O. (2010). The M-OLAP Cube Selection Problem: A Hyper-polymorphic Algorithm Approach. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2010. IDEAL 2010. Lecture Notes in Computer Science, vol 6283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15381-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-15381-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15380-8
Online ISBN: 978-3-642-15381-5
eBook Packages: Computer ScienceComputer Science (R0)