Abstract
One of the primary challenges of storing multidimensional data is the degree of sparsity that is often encountered. Because the extremely sparse cubes are frequent phenomenon, OLAP engines offer different methods of increasing the performance of sparse cubes, but all of these methods do not take account of the sparsity nature and did not divide the sparsity into any types. Our experience leads us to a following division of the empty areas in the multidimensional cubes: (a) areas that are empty because of the semantics of the business (the semantics enforces lack of value) and (b) areas that are empty by a chance. To formally distinguish these types of sparsity, we introduce a new object (“regular sparsity map”) which provides business analysts with the ability to define rules and place data constraints over the multidimensional cube. In this paper we present our regular sparsity map editor and discuss how it can be used for the purpose of data errors detection and selection of relevant dimension elements.
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
Mitchell, D. (2007). Performance management, eBook, Publisher Chandni Chowk, Delhi: Global Media.
Muller, H., and Freytag, J. (2003). Problems, Methods, and Challenges in Comprehensive Data Cleansing. Technical Report HUB-IB-164, Humboldt University Berlin, Germany.
Pedersen,T., Christian, S., Curtis,J.,and Dyreson, E. (1999). Extending Practical Pre- Aggregation. On-Line Analytical Processing, VLDB'99,663-674.
Pendse, N. (2007) The Problems with OLAP, DM Review Magazine March 2007.
Pedersen, T., and Jensen, Ch. (2005). Multidimensional Databases, The Industrial Information Technology Handbook by Richard Zurawski, pages 1-13, CRC Press.
Chaudhuri, S., and Dayal, U. (1997). An Overview of Data Warehousing and OLAP Technology. SIGMOD Record 26(1), 65-74.
Potgieter, J. (2003). OLAP Data Scalability. DM Review Magazine, October 2003. http://www.dmreview.com/dmdirect/20031031/7636-1.html
Naydenova, I. (2008). Regular Sparsity Map. ISGT’2010, Sofia, Bulgaria
Pendse,N.(2005).Database explosion. Business Application Research Center, http://www.olapreport.com/DatabaseExplosion.htm
Kang, J.,Yong, H., and Masunaga, Y. (2002). Classification of Sparsity Patterns and Performance Evaluation in OLAP System, IEIC Technical Report, ISSN:0913-5685,vol.102, No.209, pp.61- 66, Japan.
Naydenova, I., and Kaloyanova, K. (2006). Some Extensions to the Multidimensional Data Model. Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, Bulgaria, 63 – 68.
Rahm, E., and Hong Hai, Do. (2000). Data Cleaning: Problems and Current Approaches, IEEE Data Engineering Bulletin, 23(4),3-13.
Naydenova, I., and Kaloyanova, K. (2007). An Approach Of Non-Additive Measures Compression In Molap Environment, Proceedings of the IADIS Multi Conference on Computer Science and Information Systems Lisbon, Portugal, July 2007, 394-399.
Naydenova, I., Kovacheva, Z., and Kaloyanova, K.(2009). A Model of Regular Spasity Map Representation. Scientifical Journal of Ovidius University of Constantza, Romania 17(3), 197–208.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kaloyanova, K., Naydenova, I. (2011). Regular Sparsity in OLAP System. In: Carugati, A., Rossignoli, C. (eds) Emerging Themes in Information Systems and Organization Studies. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2739-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-7908-2739-2_9
Published:
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-2738-5
Online ISBN: 978-3-7908-2739-2
eBook Packages: Business and EconomicsBusiness and Management (R0)