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.
This work is supported by the National Natural Science Foundation of China under Grant No.60473072.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Vitter, J., Wang, M., Lyer, B.: Data cube approximation and histogram via wavelets. In: CIKM 1998 (1998)
Barbará, D., Sullivan, M.: Quasi-Cubes: Exploiting Approximations in Multidimensional Databases. SIGMOD Record 26(3), 12–17 (1998)
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)
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)
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)
Wang, W., Feng, J., Lu, H., Yu, J.: Condensed Cube: An Effective Approach to Reducing Data Cube Size. In: ICDE 2002 (2002)
Sarawagi, S.: Explaining differences in multidimensional aggregates. In: VLDB 1999 (1999)
Sathe, G., Sarawagi, S.: Intelligent Rollups in Multidimensional OLAP Data. In: VLDB 2001, pp. 531–540 (2001)
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)
Dong, G., Han, J., Lam, J., Pei, J., Wang, K.: Mining Multi-Dimensional Constrained Gradients in Data Cubes. In: VLDB 2001 (2001)
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)
Cui-Ping, L., Sheng-En, L., Shan, W., Xiao-Yong, D.: A Constraint-Based Multi-Dimensional Data Exception Mining Approach. Journal of Software (2003)
Yu, H., Pei, J., Tang, S., Yang, D.: Mining The Most General Multidimensional Summarization of “Probable Groups” in Data Warehouses. In: SSDBM 2005 (2005)
Box, G.E.P., Tiao, G.C.: Bayesian Inference in Statistical Analysis. Addision Wesley, Reading (1973)
Sismanis, Y., et al.: Dwarf: Shrinking the Petacube. In: SIGMOD 2002 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, D., Tan, S., Tang, S., Yang, D., Jiang, L. (2006). Adapting OLAP Analysis to the User’s Interest Through Virtual Cubes. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_59
Download citation
DOI: https://doi.org/10.1007/11881599_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45916-3
Online ISBN: 978-3-540-45917-0
eBook Packages: Computer ScienceComputer Science (R0)