CCBitmaps: A Space-Time Efficient Index Structure for OLAP

  • Weiji Xiao
  • Jianqing Xi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5678)

Abstract

Quotient Cube is a classic algorithm to build data cube for OLAP. QC-Tree is based on Quotient Cube that can compress Cube further and accelerate query. This paper proposes a new index structure CC-Bitmap for OLAP which needs less storage space and improves queries performance significantly against QC-Trees, avoiding large memory and time consumption costs meanwhile. A new intersection algorithm CCListsIntersection is presented in this paper, which improves queries efficiency highly against traditional methods. Finally, detailed experiment evaluation is given to show that CC-Bitmap is a Space-Time efficient index structure for OLAP.

Keywords

Quotient Cube Closed Cube QC-Trees CC-Bitmaps CCListsIntersection 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wang, W., Lu, H.J., Feng, J.L., Yu, J.X.: Condensed cube: An effective approach to reducing data cube size. In: Proc. of the 18th Int’l Conf. on Data Engineering, pp. 155–165. IEEE Computer Society, San Jose (2002)CrossRefGoogle Scholar
  2. 2.
    Sismanis, Y., Deligiannakis, A., Roussopoulos, N., Kotidis, Y.: Dwarf: Shrinking the PetaCube. In: Franklin, M.J., Moon, B., Ailamaki, A. (eds.) Proc. of the 2002 ACM SIGMOD Int’l Conf. on Management of Data, pp. 464–475. ACM Press, Madison (2002)CrossRefGoogle Scholar
  3. 3.
    Lakshmanan, L.V.S., Pei, J., Han, J.W.: Quotient cube: How to summarize the semantics of a data cube. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) Proc. of the 23rd Int’l Conf. on Very Large Data Bases, pp. 778–789. Morgan Kaufmann, Hong Kong (2002)CrossRefGoogle Scholar
  4. 4.
    Li, S.E., Wang, S.: Research on closed data cube technology. Journal of Software 15(8), 1165–1171 (2004)MATHGoogle Scholar
  5. 5.
    Lakshmanan, L.V.S., Pei, J., Zhao, Y.: QC-Trees: An Efficient Summary Structure for Semantic OLAP. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 64–75 (2003)Google Scholar
  6. 6.
    Zhao, Y.: Quotient Cube and QC-Tree: Efficient. Summarizations for Semantic OLAP. Ph.D thesis. The University of British Columbia (2003)Google Scholar
  7. 7.
    Hahn, C., Warren, S., London, J.: Edited synoptic cloud reports from ships and land stations over the globe (1996), http://cdiac.esd.ornl.gov/cdiac/ndps/ndp026b.html
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Weiji Xiao
    • 1
  • Jianqing Xi
    • 1
  1. 1.School of Computer Science & EngineeringSouth China University of TechnologyGuangzhou

Personalised recommendations