Abstract
Several algorithms have been developed over the years to perform join operation which is executed frequently and affects the efficiency of the database system. Some of these efforts prove that join performance mainly depends on the sequences of execution of relations in addition to the hardware architecture. In this paper, we present a method that processes a many-to-many multi join operation by using a non-recursive reverse polish notation tree for sort-merge join. Precisely, this paper sheds more light on main memory join operation of two types of sort-merge join sequences: sequential join sequences (linear tree) and general join sequences (wide bushy tree, also known as composite inner) and also tests their performance and functionality. We will also provide the algorithm of the proposed system that shows the implementation steps.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agate, S., Drury, C.: Electronic calculators: which notation is the better? Appl. ergonomics 11(1), 2–6 (1980)
Al-Rawi, A., Lansari, A., Bouslama, F.: A new non-recursive algorithm for binary search tree traversal. In: 10th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2003 (2003)
Albutiu, M.C., Kemper, A., Neumann, T.: Massively parallel sort-merge joins in main memory multi-core database systems. Proc. VLDB Endowment. 5(10), 1064–1075 (2012)
Capasso, T.: Evaluate Logical Expressions Using Recursive CTEs and Reverse Polish Notation. Penton Business Media, Inc (2014)
Chen, M.S., Yu, P., Wu, K.L.: Optimization of parallel execution for multi-join queries. IEEE Trans. Knowl. Data Eng. 8(3), 416–428 (1996)
Graefe, G.: Rule-based query optimization in extensible database systems (1987)
Kim, C., et al.: Sort vs. hash revisited: fast join implementation on modern multi-core cpus. Proc. VLDB Endowment 2(2), 1378–1389 (2009)
Kim, W.: A new way to compute the product and join of relations. In: Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data (1980)
Krtolica, P., Stanimirovi, P.: Reverse polish notation method. Int. J. Comput. Math. 81(3), 273–284 (2004)
Mishra, P., Eich, M.: Join processing in relational databases. ACM Comput. Surv. (CSUR) 24(1), 63–113 (1992)
Navathe, S., Elmasri, R.: Fundamentals of Database Systems, pp. 652–660. Pearson Education, Upper Saddle River (2010)
Ono, K., Lohman, G.: Measuring the complexity of join enumeration in query optimization. In: VLDB (1990)
Taniar, D., Tan, R.B.N.: Parallel processing of multi-join expansion-aggregate data cube query in high performance database systems. In: International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 (2002)
Wilschut, A., Flokstra, J., Apers, P.: Parallel evaluation of multi-join queries. In: ACM SIGMOD Record (1995)
Acknowledgments
We would like to thank Nada Alzahrani for her efforts during the progress of this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Asiri, N., Alsulim, R. (2016). Non-recursive Approach for Sort-Merge Join Operation. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery. BDAS BDAS 2015 2016. Communications in Computer and Information Science, vol 613. Springer, Cham. https://doi.org/10.1007/978-3-319-34099-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-34099-9_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-34098-2
Online ISBN: 978-3-319-34099-9
eBook Packages: Computer ScienceComputer Science (R0)