Skip to main content
SpringerLink
Log in

First-Half Index Base for Querying Data Cube

  • Conference paper
  • First Online:
Intelligent Systems and Applications (IntelliSys 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 868))

Included in the following conference series:

Abstract

Given a relational fact table R, we call a base of data cubes on R a structure that allows to query the data cubes with any aggregate function. This work presents a compact base of data cubes, called the first-half index base, with its implementation, and the method for querying the data cubes using this base. Through experiments on real datasets, we show how the first-half index base resolves efficiently the main data cube issues, i.e., the storage space and the query response time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agarwal, S., et al.: On the computation of multidimensional aggregates. In: Proceedings of VLDB 1996, pp. 506–521 (1996)

    Google Scholar 

  2. Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing data cubes efficiently. In: Proceedings of SIGMOD 1996, pp. 205–216 (1996)

    Article  Google Scholar 

  3. Blackard, J.A.: The forest covertype dataset. ftp://ftp.ics.uci.edu/pub/machine-learning-databases/covtype

  4. 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

  5. Census Modified Race Data Summary File for Counties Alabama through Missouri. http://www.census.gov/popest/research/modified/STCO-MR2010_AL_MO.csv

  6. Online Retail Data Set, UCI Machine Learning Repository. https://archive.ics.uci.edu/ml/datasets/Online+Retail

  7. Ross, K.A., Srivastava, D.: Fast computation of sparse data cubes. InL Proceedings of VLDB 1997, pp. 116–125 (1997)

    Google Scholar 

  8. Beyer, K.S., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: Proceedings of ACM Special Interest Group on Management of Data (SIGMOD 1999), pp. 359–370 (1999)

    Article  Google Scholar 

  9. Vitter, J.S., Wang, M., Iyer, B.R.: Data cube approximation and histograms via wavelets. In: Proceedings of International Conference on Information and Knowledge Management (CIKM 1998), pp. 96–104 (1998)

    Google Scholar 

  10. Han, J., Pei, J., Dong, G., Wang, K.: Efficient computation of iceberg cubes with complex measures. In: Proceedings of ACM SIGMOD 2001, pp. 441–448 (2001)

    Google Scholar 

  11. Lakshmanan, L., Pei, J., Han, J.: Quotient cube: how to summarize the semantics of a data cube. In: Proceedings of VLDB 2002, pp. 778–789 (2002)

    Chapter  Google Scholar 

  12. Phan-Luong, V.: A simple and efficient method for computing data cubes. In: Proceedings of The 4th International Conference on Communications, Computation, Networks and Technologies INNOV 2015, pp. 50–55 (2015)

    Google Scholar 

  13. Phan-Luong, V.: A simple data cube representation for efficient computing and updating. Int. J. Adv. Intell. Syst. 9(3–4), 255–264 (2016). http://www.iariajournals.org/intelligent_systems

  14. Phan-Luong, V.: Searching data cube for submerging and emerging cuboids. In: Proceedings of The 2017 IEEE International Conference on Advanced Information Networking and Applications Science AINA 2017, pp. 586–593. IEEE (2017)

    Google Scholar 

  15. Sismanis, Y., Deligiannakis, A., Roussopoulos, N., Kotidis, Y.: Dwarf: shrinking the PetaCube. In: Proceedings of ACM SIGMOD 2002, pp. 464–475 (2002)

    Google Scholar 

  16. Wang, W., Lu, H., Feng, J., Yu, J.X.: Condensed cube: an efficient approach to reducing data cube size. In: Proceedings of International Conference on Data Engineering, pp. 155–165 (2002)

    Google Scholar 

  17. Casali, A., Cicchetti, R., Lakhal, L.: Extracting semantics from data cubes using cube transversals and closures. In: Proceedings of International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 69–78 (2003)

    Google Scholar 

  18. Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L., Novelli, N.: Lossless reduction of datacubes using partitions. Int. J. Data Warehous. Min. (IJDWM) 5(1), 18–35 (2009)

    Article  Google Scholar 

  19. Lakshmanan, L., Pei, J., Zhao, Y.: QC-Trees: an efficient summary structure for semantic OLAP. In: Proceedings of ACM SIGMOD 2003, pp. 64–75 (2003)

    Google Scholar 

  20. Xin, D., Han, J., Li, X., Wah, B.W.: Star-cubing: computing iceberg cubes by top-down and bottom-up integration. In: Proceedings of VLDB 2003, pp. 476–487 (2003)

    Chapter  Google Scholar 

  21. Feng, Y., Agrawal, D., Abbadi, A.E., Metwally, A.: Range cube: efficient cube computation by exploiting data correlation. In: Proceedings of International Conference on Data Engineering, pp. 658–670 (2004)

    Google Scholar 

  22. Shao, Z., Han, J., Xin, D.: Mm-cubing: computing iceberg cubes by factorizing the lattice space. In: Proceedings of International Conference on Scientific and Statistical Database Management (SSDBM 2004), pp. 213–222 (2004)

    Google Scholar 

  23. Morfonios, K., Ioannidis, Y.: Supporting the data cube lifecycle: the power of ROLAP. VLDB J. 17(4), 729–764 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aix-Marseille Univ, Université de Toulon, CNRS, LIS, Equipe BDA, Marseille, France

    Viet Phan-Luong

Authors
  1. Viet Phan-Luong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Viet Phan-Luong .

Editor information

Editors and Affiliations

  1. Faculty of Science and Engineering, Saga University, Saga, Japan

    Kohei Arai

  2. The Science and Information (SAI) Organization, Bradford, UK

    Supriya Kapoor

  3. The Science and Information (SAI) Organization, Bradford, UK

    Rahul Bhatia

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Phan-Luong, V. (2019). First-Half Index Base for Querying Data Cube. In: Arai, K., Kapoor, S., Bhatia, R. (eds) Intelligent Systems and Applications. IntelliSys 2018. Advances in Intelligent Systems and Computing, vol 868. Springer, Cham. https://doi.org/10.1007/978-3-030-01054-6_78

Download citation

Publish with us

Policies and ethics

Search

Navigation