Skip to main content
SpringerLink
Log in

PMC: Select Materialized Cells in Data Cubes

  • Database and Knowledge-Based Systems
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

QC-Tree is one of the most storage-efficient structures for data cubes in an MOLAP system. Although QC-Tree can achieve a high compression ratio, it is still a fully materialized data cube. In this paper, an improved structure PMC is presented allowing us to materialize only a part of the cells in a QC-Tree to save more storage space. There is a notable difference between our partially materialization algorithm and traditional materialized views selection algorithms. In a traditional algorithm, when a view is selected, all the cells in this view are to be materialized. Otherwise, if a view is not selected, all the cells in this view will not be materialized. This strategy results in the unstable query performance. The presented algorithm, however, selects and materializes data in cell level, and, along with further reduced space and update cost, it can ensure a stable query performance. A series of experiments are conducted on both synthetic and real data sets. The results show that PMC can further reduce storage space occupied by the data cube, and can shorten the time to update the 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 et al. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In ICDE, New Orleans, 1996, pp.152–159.

  2. Lakshmanan L, Pei J, Han J. Quotient cube: How to summarize the semantics of a data cube. In VLDB, Hong Kong, China, 2002, pp.778–789.

  3. Lakshmanan L, Pei J, Zhao Y. QC-trees: An efficient summary structure for semantic OLAP. In ACM SIGMOD, San Diego, California, USA, 2003, pp.64–75.

  4. Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y. Dwarf: Shrinking the petacube. In SIGMOD, Madison, Wisconsin, USA, 2002, pp.464–475.

  5. Nick Roussopoulos, Yannis Kotidis, Mema Roussopoulos. Cubetree: Organization of and bulk incremental updates on the data cube. In SIGMOD, Tucson, Arizona, 1997, pp.89–99.

  6. Hahn C et al. Edited synoptic cloud reports from ships and land stations over the globe, 1982–1991. http://cdiac.est.ornl.gov/ftp/ndp026b/SEP85L.Z, 1994.

  7. Baralis E, Paraboschi S, Teniente E. Materialized view selection in a multidimensional database. In VLDB, Athens, Greece, 1997, pp.156–165.

  8. Gupta H. Selection of views to materialize in a data warehouse. In ICDT, Delphi, Greece, 1997, pp.98–112.

  9. Gupta H, Mumick I. Selection of views to materialize under a maintenance cost constraint. In ICDT, Jerusalem, Israel, 1999, pp.453–470.

  10. Theodoratos D, Bouzeghoub M. A general framework for the view selection problem for data warehouse design and evolution. In DOLAP, Washington DC, USA, 2000, pp.1–8.

  11. Liang W, Wang H, Orlowska M. Materialized view selection under the maintenance time constraint. Data & Knowledge Engineering, 2001, 37: 203–216.

    Article  Google Scholar 

  12. Zhang C, Yao X, Yang J. An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Trans. Systems, Man and Cybernetics, Part C, August 2001, 31(3): 282–294.

    Google Scholar 

  13. Bauer A, Lehner W. On solving the view selection problem in distributed data warehouse architectures. In SSDBM, Cambridge, Massachusetts, USA, 2003, pp.9–11.

  14. Gupta H, Mumick I S. Selection of views to materialize in a data warehouse. TKDE, 2005, 17(1): 24–43.

    Google Scholar 

  15. Agrawal S, Chaudhuri S, Narasayya V. Automated selection of materialized views and indexes in SQL databases. In VLDB, Cairo, Egypt, 2000, pp.496–505.

  16. Chirkova R et al., Halevy A Y, Suciu D. A formal perspective on the view selection problem. In VLDB, Roma, Italy, 2001, pp.59–68.

  17. Chirkova R, Li C. Materializing views with minimal size to answer queries. In PODS, San Diego, California, USA, 2003, pp.38–48.

  18. Zhao Y, DeshPande P, Naughton J. An array-based algorithm for simultaneous multidimensional aggregates. In SIGMOD, Tucson, Arizona, 1997, pp.159–170.

  19. Li J, Li Y, Srivastava J. Efficient aggregation algorithms on very large compressed data warehouses. J. Comput. Sci. Technol., 2000, 15(3): 213–229.

    Google Scholar 

  20. Beyer K, Ramakrishnan R. Bottom-up computation of sparse and iceberg cubes. In SIGMOD, Philadelphia, Pennsylvania, USA, 1999, pp.359–370.

  21. Shanmugasundaram J, Fayyad U, Bradley P. Compressed data cubes for OLAP aggregate query approximation on continuous dimensions. In KDD, San Diego, California, USA, 1999, pp.223–232.

  22. Wang W, Lu H, Feng J, Yu J. Condensed cube: An effective approach to reducing data cube size. In ICDE, San Jose, California, USA, 2002, pp.155–165.

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Technology, Beijing Jiaotong University, Beijing, 100044, P.R. China

    Hong-Song Li & Hou-Kuan Huang

Authors
  1. Hong-Song Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hou-Kuan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong-Song Li.

Additional information

Supported by the National Key Scientific and Technological Project: Research on the Management of the Railroad Fundamental Information (Grant No.2002BA407B01-2) and the Science Foundation of Beijing Jiaotong University (Grant No.2003SZ003).

Hong-Song Li received his B.S. and M.S. degrees from Beijing Jiaotong University in 1995 and 2002 respectively. He is currently a Ph.D. candidate of School of Computer & Information Technology, Beijing Jiaotong University, China, majoring in computer application technology. His research interests include data warehousing, data mining and data streaming.

Hou-Kuan Huang did his undergraduate study at Peking University majoring in mathematics during 1957–1963, and graduate study at Harbin Engineering University majoring in applied mathematics during 1963–1966. He is currently a professor and Ph.D. supervisor, and vice-chairman of Degree Evaluation Committee of Beijing Jiaotong University (BJTU, previously named Northern Jiaotong University), and chairman of Academic Committee of School of Computer & Information Technology, BJTU, and vice-director & secretary general of Artificial Intelligence & Pattern Recognition Society of China Computer Federation, and committee member of China Software Industry Association, China Machine Learning Society, and China Knowledge Engineering Society. He has been chairman of Dept. Computer & Information Science, Harbin Engineering University from 1987 to 1990, and chairman of Dept. Computer Science and Technology, Northern Jiaotong University from 1994 to 1999. His research fields include artificial intelligence, machine learning, data warehousing, data mining, decision support system, and multi-agent system, etc.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, HS., Huang, HK. PMC: Select Materialized Cells in Data Cubes. J Comput Sci Technol 21, 297–305 (2006). https://doi.org/10.1007/s11390-006-0297-0

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-006-0297-0

Keywords

Search

Navigation