Advertisement

Adapting OLAP Analysis to the User’s Interest Through Virtual Cubes

  • Dehui Zhang
  • Shaohua Tan
  • Shiwei Tang
  • Dongqing Yang
  • Lizheng Jiang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4223)

Abstract

The manually performing of the operators turns OLAP analysis a tedious procedure. The huge user’s exploration space is the major reason of this problem. Most methods in the literature are proposed in the data perspective, without considering much of the users’ interests. In this paper, we adapt the OLAP analysis to the user’s interest on the data through the virtual cubes to reduce the user’s exploration space in OLAP. We first extract the user’s interest from the access history, and then we create the virtual cube accordingly. The virtual cube allows the analysts to focus their eyes only on the interesting data, while the uninteresting information is maintained in a generalized form. The Bayesian estimation was employed to model the access history. We presented the definition and the construction algorithm of virtual cubes. We proposed two new OLAP operators, through which the whole data cube can be obtained, and we also prove that no more response delay is incurred by the virtual cubes. Experiments results show the effectiveness and the efficiency of our approach.

Keywords

Exploration Space Bayesian Estimation Data Cube Virtual Cell Interesting Member 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Vitter, J., Wang, M., Lyer, B.: Data cube approximation and histogram via wavelets. In: CIKM 1998 (1998)Google Scholar
  2. 2.
    Barbará, D., Sullivan, M.: Quasi-Cubes: Exploiting Approximations in Multidimensional Databases. SIGMOD Record 26(3), 12–17 (1998)CrossRefGoogle Scholar
  3. 3.
    Shanmugasundaram, J., Fayyad, U.M., Bradley, P.S.: Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions. In: KDD 1999, pp. 223–232 (1999)Google Scholar
  4. 4.
    Feng, Y., Agrawal, D., Abbadi, A.E.: Ahmed Metwally: Range CUBE: Efficient Cube Computation by Exploiting Data Correlation. In: ICDE 2004, pp. 658–670 (2004)Google Scholar
  5. 5.
    Lakshmanan, L.V.S., Pei, J., Han, J.: Quotient Cube: How to Summarize the Semantics of a Data Cube. In: Bressan, S., Chaudhri, A.B., Li Lee, M., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol. 2590, pp. 778–789. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Wang, W., Feng, J., Lu, H., Yu, J.: Condensed Cube: An Effective Approach to Reducing Data Cube Size. In: ICDE 2002 (2002)Google Scholar
  7. 7.
    Sarawagi, S.: Explaining differences in multidimensional aggregates. In: VLDB 1999 (1999)Google Scholar
  8. 8.
    Sathe, G., Sarawagi, S.: Intelligent Rollups in Multidimensional OLAP Data. In: VLDB 2001, pp. 531–540 (2001)Google Scholar
  9. 9.
    Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. In: ACM SIGMOD 2004 (2004)Google Scholar
  10. 10.
    Dong, G., Han, J., Lam, J., Pei, J., Wang, K.: Mining Multi-Dimensional Constrained Gradients in Data Cubes. In: VLDB 2001 (2001)Google Scholar
  11. 11.
    Shi, Y., Song, Y., Zhang, A.: A Sringking-Based Approach for Multi-Dimensaional data Analysis. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Cui-Ping, L., Sheng-En, L., Shan, W., Xiao-Yong, D.: A Constraint-Based Multi-Dimensional Data Exception Mining Approach. Journal of Software (2003)Google Scholar
  13. 13.
    Yu, H., Pei, J., Tang, S., Yang, D.: Mining The Most General Multidimensional Summarization of “Probable Groups” in Data Warehouses. In: SSDBM 2005 (2005)Google Scholar
  14. 14.
    Box, G.E.P., Tiao, G.C.: Bayesian Inference in Statistical Analysis. Addision Wesley, Reading (1973)zbMATHGoogle Scholar
  15. 15.
    Sismanis, Y., et al.: Dwarf: Shrinking the Petacube. In: SIGMOD 2002 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dehui Zhang
    • 1
  • Shaohua Tan
    • 1
  • Shiwei Tang
    • 1
  • Dongqing Yang
    • 1
  • Lizheng Jiang
    • 1
  1. 1.School of Electronics Engineering and Computer SciencePeking UniversityBeijingChina

Personalised recommendations