Skip to main content

Towards a Scalable, Performance-Oriented OLAP Storage Engine

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7239))

Abstract

Over the past generation, data warehousing and OLAP applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional relational DBMSs (ROLAP). While MOLAP systems do indeed provide impressive performance on common analytics queries, they tend to have limited scalability. Conversely, ROLAP’s table oriented model scales quite nicely, but offers mediocre performance at best relative to the MOLAP systems. In this paper, we describe a storage and indexing framework that aims to provide both MOLAP like performance and ROLAP like scalability by essentially combining some of the best features of both. Based upon a combination of R-trees and bitmap indexes, the storage engine has been integrated with a robust OLAP query engine prototype that is able to fully exploit the efficiency of the proposed storage model. Experimental results demonstrate that not only does the framework improve upon more naive approaches, but that it does indeed offer the potential to optimize both query performance and scalability.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abouzeid, A., Bajda-Pawlikowski, K., Abadi, D., Silberschatz, A., Rasin, A.: Hadoopdb: an architectural hybrid of mapreduce and dbms technologies for analytical workloads. Proc. VLDB Endow. 2, 922–933 (2009)

    Google Scholar 

  2. Berkeley db (2011), http://www.oracle.com/technetwork/database/berkeleydb/overview/index.html

  3. Dean, J., Ghemawat, S.: Mapreduce: a flexible data processing tool. Commununications of the ACM 53, 72–77 (2010)

    Article  Google Scholar 

  4. Dehne, F., E.T., Rau-Chaplin, A.: Rcube: Parallel multi-dimensional rolap indexing. Journal of Data Warehousing and Mining 4, 1–14 (2008)

    Google Scholar 

  5. Eavis, T., Cueva, D.: The lbf r-tree: Efficient multidimensional indexing with graceful degradation. In: 22nd International Database Engineering and Applications Symposium, IDEAS 2007 (2007)

    Google Scholar 

  6. Eavis, T., Taleb, A.: Mapgraph: efficient methods for complex olap hierarchies. In: Conference on Information and Knowledge Management, pp. 465–474 (2007)

    Google Scholar 

  7. Zimanyi, E., Malinowski, E.: Hierarchies in a conceptual mode, from conceptual modeling to logical representation. In: Data & KNowledge Engineering (2005)

    Google Scholar 

  8. Fastbit (2011), https://sdm.lbl.gov/fastbit/

  9. Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In: International Conference on Data Engineering (ICDE), pp. 152–159. IEEE Computer Society, Washington, DC (1996)

    Google Scholar 

  10. Gupta, H., Harinarayan, V., Rajaraman, A., Ullman, J.D.: Index selection for olap. In: Proceedings of the Thirteenth International Conference on Data Engineering, ICDE 1997, pp. 208–219. IEEE Computer Society, Washington, DC (1997)

    Chapter  Google Scholar 

  11. Lakshmanan, L.V.S., Pei, J., Zhao, Y.: Qc-trees: an efficient summary structure for semantic olap. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 64–75. ACM, New York (2003)

    Chapter  Google Scholar 

  12. Microsoft analysis services (2011), http://www.microsoft.com/sqlserver/2008/en/us/analysis-services.aspx

  13. Mondrian (2011), http://www.mondrian.pentaho.org

  14. Morfonios, K., Ioannidis, Y.: Cure for cubes: cubing using a rolap engine. In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, pp. 379–390. VLDB Endowment (2006)

    Google Scholar 

  15. Oracle olap (2011), http://www.oracle.com/technology/products/bi/olap/index.html

  16. Plattner, H.: A common database approach for oltp and olap using an in-memory column database. In: Proceedings of the 35th SIGMOD International Conference on Management of Data, SIGMOD 2009, pp. 1–2 (2009)

    Google Scholar 

  17. Roussopoulos, N., Kotidis, Y., Roussopoulos, M.: Cubetree: organization of and bulk incremental updates on the data cube. In: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, SIGMOD 1997, pp. 89–99. ACM, New York (1997)

    Chapter  Google Scholar 

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

    Google Scholar 

  19. Stonebraker, M., Abadi, D., DeWitt, D.J., Madden, S., Paulson, E., Pavlo, A., Rasin, A.: Mapreduce and parallel dbmss: friends or foes? Commun. ACM 53, 64–71 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eavis, T., Taleb, A. (2012). Towards a Scalable, Performance-Oriented OLAP Storage Engine. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29035-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29035-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29034-3

  • Online ISBN: 978-3-642-29035-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics