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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
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
R. C. Agarwal.: A Super Scalar Sort Algorithm for RISC Processors. ACM SIGMOD Record, 1996, 25(2): 240–246
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
S. Berchtold,, D. A. Keim.: High-Dimensional Index Structures Database Support for Next Decade’s Applications. ACM SIGMOD Record, 1998, 27(2): 501
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
G. Graefe: Query evaluation techniques for large databases. ACM Computing Surveys, 1993, 25(2):73–130
G. Graefe: A. Linville, L.D. Shapiro. Sort vs. Hash Revisited. IEEE Transactions on Knowledge and Data Engineering, 1994, 6(6): 934–944
Y. Kotidis, N. Roussopoulos.: An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees. ACM SIGMOD Record, 1998, 27(2): 249–258
P. O’Neil, G. Graefe.: Multi-Table Joins Through Bitmapped Join Indices. SIGMOD Record, 1995, 24(3): 8–11
P. O’Neil, D. Quass.: Improved Query Performance with Variant Indexes. ACM SIGMOD Record, 1997, 26(2):38–49
Redbrick Systems’ White Paper. Star Schemes and Star Join Technology. RedBrick Systems, Los Gatos, CA, September 1995
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
S. N. Subramanian, S. Venkataraman.: Cost-Based Optimization of Decision Support Queries using Transient-Views. ACM SIGMOD Record, 1998, 27(2): 319–330
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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