Improving performance by creating a native join-index for OLAP

Abstract

The performance of online analytical processing (OLAP) is critical for meeting the increasing requirements of massive volume analytical applications. Typical techniques, such as in-memory processing, column-storage, and join indexes focus on high performance storage media, efficient storage models, and reduced query processing. While they effectively perform OLAP applications, there is a vital limitation: main-memory database based OLAP (MMOLAP) cannot provide high performance for a large size data set. In this paper, we propose a novel memory dimension table model, in which the primary keys of the dimension table can be directly mapped to dimensional tuple addresses. To achieve higher performance of dimensional tuple access, we optimize our storage model for dimension tables based on OLAP query workload features. We present directly dimensional tuple accessing (DDTA) based join (DDTA-JOIN), a technique to optimize query processing on the memory dimension table by direct dimensional tuple access. We also contribute by proposing an optimization of the predicate tree to shorten predicate operation length by pruning useless predicate processing. Our experimental results show that the DDTA-JOIN algorithm is superior to both simulated row-store main memory query processing and the open-source column-store main memory database MonetDB, thanks to the reduced join cost and simple yet efficient query processing.

Keywords

directly dimensional tuple accessing (DDTA) / DDTA-JOIN / native join-index / predicate tree

References

[1] O'Neil P, O'Neil B, Chen X. The star schema benchmark (SSB). http://www.cs.umb.edu/~poneil/StarSchemaB.PDF

[2] Johnson R, Raman V, Sidle R, Swart G. Row-wise parallel predicate evaluation. In: Proceedings of VLDB Endowment, 2008, 1(1): 622-634

[3] Stonebraker M, Abadi D J, Batkin A, Chen X, Cherniack M, Ferreira M, Lau E, Lin A, Madden S, O’Neil E J, O’Neil P E, Rasin A, Tran N, Zdonik S B. C-store: A column-oriented DBMS. In: Proceedings of the 29th International Conference on Very Large Data Bases. 2005, 553-564

[4] MacNicol R, French B. Sybase IQ multiplex-designed for analytics. In: Proceedings of the 30th International Conference on Very Large Data Bases. 2004, 1227-1230

[5] Boncz P A, Manegold S, Kersten M L. Database architecture optimized for the new bottleneck: memory access. In: Proceedings of the 25th International Conference on Very Large Data Bases. 1999, 54-65

[6] Ailamaki D J, DeWitt D J, Hill M D. Data page layouts for relational databases on deep memory hierarchies. VLDB Journal, 2002, 11(3): 198-215

[7] Hankins R A, Patel J M. Data morphing: an adaptive, cache-conscious storage technique. In: Proceedings of the 29th international conference on Very Large Data Bases. 2003, 417-428

[8] Bruno N. Teaching an old elephant new tricks. In: Proceedings of 4th Biennial Conference on Innovative Data Systems Research. 2009

[9] Abadi D J, Myers D S, DeWitt D J, Madden S. Materialization strategies in a column-oriented DBMS. In: Proceedings of the 23rd International Conference on Data Engineering. 2007, 466-475

[10] Zukowski M, Nes N, Boncz P A. DSM vs. NSM: CPU performance tradeoffs in block-oriented query processing. In: Proceedings of the 4th International Workshop on Data Management on New Hardware. 2008, 47-54

[11] Abadi D J, Madden S R, Hachem N. Column-stores vs. row-stores: how different are they really? In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2008, 967-980

Acknowledgements

This work was supported by the National High Technology Research and Development Program of China (2009AA01Z149), the Major National Science and Technology Project of China (2010ZX01042-001-002-002), the joint research of Large Scale Data Management for HP Laboratory China and Renmin University.

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg