Skip to main content
Springer Nature Link
Log in

OLAP Query Processing Algorithm Based on Relational Storage

  • Conference paper
  • First Online:
Advances in Web-Age Information Management (WAIM 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2419))

Included in the following conference series:

  • 333 Accesses

Abstract

When the relational storage method is adopted in the data warehouse system, the most time-consuming operations in OLAP query are multi-table join and group-by aggregation. Based on the characteristics of the data warehouse itself and the applications run on it, one new multi-table join algorithm -- Mjoin is given in this paper. And the performance of this new Mjoin algorithm is improved greatly, compared with other traditional multi-table join algorithms. In this paper, a new sorting based group-by aggregation algorithm — MuSA is also given, based on the Mjoin algorithm. The speed of sorting is remarkably improved in this new sorting based aggregation algorithm, as the keyword mapping technology is used to compress the sort keywords in the course of sorting.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Reference

  1. S. Agarwal, R., Agrawal, P.M., Deshpande et al.: On the computation of Multidimensional Aggregates. In: Vijayaraman T M ed, Proceedings of 22th International Conference on Very Large Data Bases, India: Bombay, Morgan Kaufmann, (1996) 506–521

    Google Scholar 

  2. R. C. Agarwal.: A Super Scalar Sort Algorithm for RISC Processors. ACM SIGMOD Record, 1996, 25(2): 240–246

    Article  Google Scholar 

  3. A.C. Arpaci-Dusseau,, R.H. Arpaci-Dusseau,, D.E. Culler.: High-Performance Sorting on Networks of Workstations. ACM SIGMOD Record, 1997, 26(2):243–254

    Article  Google Scholar 

  4. S. Berchtold,, D. A. Keim.: High-Dimensional Index Structures Database Support for Next Decade’s Applications. ACM SIGMOD Record, 1998, 27(2): 501

    Article  Google Scholar 

  5. S. Chaudhuri, K. Shim.: Including Group-By in Query Optimization. In: Jorge B. Bocca ed. Proceedings of the 20th International Conference on Very Large Data Bases, 1994, Chile:Santiago de Chile, Morgan Kaufmann, 1994. 354–366

    Google Scholar 

  6. G. Graefe: Query evaluation techniques for large databases. ACM Computing Surveys, 1993, 25(2):73–130

    Article  Google Scholar 

  7. G. Graefe: A. Linville, L.D. Shapiro. Sort vs. Hash Revisited. IEEE Transactions on Knowledge and Data Engineering, 1994, 6(6): 934–944

    Article  Google Scholar 

  8. Y. Kotidis, N. Roussopoulos.: An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees. ACM SIGMOD Record, 1998, 27(2): 249–258

    Article  Google Scholar 

  9. P. O’Neil, G. Graefe.: Multi-Table Joins Through Bitmapped Join Indices. SIGMOD Record, 1995, 24(3): 8–11

    Article  Google Scholar 

  10. P. O’Neil, D. Quass.: Improved Query Performance with Variant Indexes. ACM SIGMOD Record, 1997, 26(2):38–49

    Article  Google Scholar 

  11. Redbrick Systems’ White Paper. Star Schemes and Star Join Technology. RedBrick Systems, Los Gatos, CA, September 1995

    Google Scholar 

  12. D. Srivastava, S. Dar, H.V. Jagadish, et al.: Answering Queries with Aggregation Using Views. In: Vijayaraman T M ed, Proceedings of 22th International Conference on Very Large Data Bases, India: Bombay, Morgan Kaufmann, 1996. 318–329

    Google Scholar 

  13. S. N. Subramanian, S. Venkataraman.: Cost-Based Optimization of Decision Support Queries using Transient-Views. ACM SIGMOD Record, 1998, 27(2): 319–330

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China

    Jianhua Feng, Li Chao, Xudong Jiang & Lizhu Zhou

Authors
  1. Jianhua Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Chao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xudong Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lizhu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information School, Renmin University of China, Beijing, 100872, China

    Xiaofeng Meng

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106-5110, USA

    Jianwen Su  & Yujun Wang  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, J., Chao, L., Jiang, X., Zhou, L. (2002). OLAP Query Processing Algorithm Based on Relational Storage. In: Meng, X., Su, J., Wang, Y. (eds) Advances in Web-Age Information Management. WAIM 2002. Lecture Notes in Computer Science, vol 2419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45703-8_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45703-8_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44045-1

  • Online ISBN: 978-3-540-45703-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation