Skip to main content
SpringerLink
Log in

Semi-Closed Cube: An Effective Approach to Trading Off Data Cube Size and Query Response Time

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The results of data cube will occupy huge amount of disk space when the base table is of a large number of attributes. A new type of data cube, compact data cube like condensed cube and quotient cube, was proposed to solve the problem. It compresses data cube dramatically. However, its query cost is so high that it cannot be used in most applications. This paper introduces the semi-closed cube to reduce the size of data cube and achieve almost the same query response time as the data cube does. Semi-closed cube is a generalization of condensed cube and quotient cube and is constructed from a quotient cube. When the query cost of quotient cube is higher than a given threshold, semi-closed cube selects some views and picks a fellow for each of them. All the tuples of those views are materialized except those closed by their fellows. To find a tuple of those views, users only need to scan the view and its fellow. Thus, their query performance is improved. Experiments were conducted using a real-world data set. The results show that semi-closed cube is an effective approach of data cube.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gray J, Bosworth A, Layman A, Pirahesh H. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Proc. 12th Int. Conf. Data Engineering, New Orleans, Louisiana, Feb. 26–Mar. 1, 1996, pp.152–159.

  2. Harinarayan V, Rajaraman A, Ullman J D. Implementing data cubes efficiently. In Proc. ACM SIGMOD Int. Conf. Management of Data, Montreal, Canada, June 4–6, 1996, pp.205–216.

  3. Shukla A, Deshpande P M, Naughton J F. Materialized view selection for multidimensional datasets. In Proc. 24th Int. Conf. Very Large Data Base, New York City, NY, August 24–27, 1998, pp.488–499.

  4. Wei Wang, Hongjun Lu, Jianlin Feng, Jeffrey Xu Yu. Condensed cube: An effective approach to reducing data cube size. In Proc. 18th Int. Conf. Data Engineering, San Jose, CA, February 26–March 1, 2002, pp.155–165.

  5. Lakshmanan L V S, Pei Jian, Han Jiawei. Quotient cube: How to summarize the semantics of a data cube. In Proc. 23rd Int. Conf. Very Large Data Bases, Hong Kong, China, August 20–23, 2002, pp.778–789.

  6. Vitter J S, Wang M. Data cube approximation and histogram via wavelets. In Proc. 7th Int. Conf. Information and Knowledge Management, Bethesda, Maryland, November 3–7, 1998, pp.96–104.

  7. Kotidis Y, Roussopoulos N. An alternative storage organization for ROLAP aggregate views based on cubetrees. In Proc. ACM SIGMOD Int. Conf. Management of Data, Seattle, Washington, June 2–4, 1998, pp.249–258.

  8. Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y. Dwarf: Shrinking the PetaCube. In Proc. ACM SIGMOD Int. Conf. Management of Data, Madison, Wisconsin, June 3–6, 2002, pp.464–475.

  9. Lakshmanan L V S, Pei Jian, Zhao Yan. QC-Trees: An efficient summary structure for semantic OLAP. In Proc. ACM SIGMOD Int. Conf. Management of Data, San Diego, California, June 9–12, 2003, pp.64–75.

  10. Li Sheng-En, Wang Shan. Research on closed data cube technology. Journal of Software, 2004, 15(8): 1165–1171.

    Google Scholar 

  11. Beyer K, Ramakrishnan R. Bottom-up computation of sparse and Iceberg CUBEs. In Proc. ACM SIGMOD Int. Conf. Management of Data, Philadelphia, Pennsylvania, June 1–3, 1999, pp.359–370.

  12. Hahn C, Warren S, London J. Edited synoptic cloud reports from ships and land stations over the globe. http://cdiac.esd.ornl.gov/cdiac/ndps/ndp026b.html

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Shandong Institute of Architecture and Engineering, Jinan, 250014, P.R. China

    Sheng-En Li

  2. School of Information, Renmin University, Beijing, 100872, P.R. China

    Sheng-En Li & Shan Wang

Authors
  1. Sheng-En Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sheng-En Li.

Additional information

Supported by the National Natural Science Foundation of China under Grant No.604963205, the National High Technology Development 863 Program of China under Grant No.2003AA4Z3030, and the National Basic Research 973 Program of China under Grant No.2001CCA03003.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, SE., Wang, S. Semi-Closed Cube: An Effective Approach to Trading Off Data Cube Size and Query Response Time. J Comput Sci Technol 20, 367–372 (2005). https://doi.org/10.1007/s11390-005-0367-8

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0367-8

Keywords

Search

Navigation