This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
A Review of Algorithms for the Join Ordering Problem in Relational Database Systems
Authors
Chintal Upendra Raval, Professor Kaushal Madhu
Abstract
Finding the optimal join ordering for a database query is a complex combinatorial optimization problem which has been approached by a wide variety of strategies and algorithms, ranging from simple deterministic search to complex hybrid algorithms based on genetic search and incorporating domain-specific heuristics. In this paper we review a set of join ordering algorithms and classify them according to the nature of the search strategy they implement. We also briefly discuss the relative advantages and applicability of different algorithms.
Keywords- Query optimization; join ordering, relational databases: query execution plan; deterministic algorithms; randomized algorithms; genetic algorithms; hybrid algorithms, Multi Join Query Ordering.
Publication Details
Unique Identification Number - IJEDR1504128Page Number(s) - 733-743Pubished in - Volume 3 | Issue 4 | December 2015DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Chintal Upendra Raval, Professor Kaushal Madhu, "A Review of Algorithms for the Join Ordering Problem in Relational Database Systems", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.3, Issue 4, pp.733-743, December 2015, Available at :http://www.ijedr.org/papers/IJEDR1504128.pdf
Article Preview
|
|
||||||
|
|
||||||||
