Abstract
One problem facing many existing OLAP (On-Line Analytical Process) systems is the so-called ragged dimensions. Ragged dimensions occur if the logical parents of some members in a dimension hierarchy are two or more levels apart. In other words, there exist empty holes in the dimension hierarchy. The problems caused by ragged dimension are two-fold. First, aggregation of measure data could be incorrect. Second, the pre-computation strategy, the most prevalent technique used to speed up query processing in current OLAP system, could be rendered invalid. This paper proposes a simple yet efficient solution to remedy the ragged dimension problem for existing OLAP systems.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, L., Zou, H., Li, Z. (2005). A Solution to Ragged Dimension Problem in OLAP. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_128
Download citation
DOI: https://doi.org/10.1007/11539902_128
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)