Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/58502
Title: Join order algorithm using predefined optimal join order
Authors: Areerat Trongratsameethong
Keywords: Computer Science
Issue Date: 15-May-2018
Abstract: © 2017 IEEE. This paper proposes an optimization algorithm named Join Order Algorithm Using Predefined Optimal Join Order or is called JAPO algorithm to optimize join cost. Optimal join order solutions for all possible join patterns are predefined and stored in a file using Dynamic Programming with Memorization technique or is called DPM algorithm. JAPO algorithm searches join order solutions from the predefined optimal join orders using hash function instead of traversing all search space. Experiments are conducted and join costs obtained by JAPO algorithm are compared with DPM algorithm and greedy algorithm named GOO. The experimental results show that JAPO algorithm with polynomial time complexity obtains almost 100 percent of optimal join order solutions. DPM algorithm obtains 100 percent of optimal join order solutions with factorial time complexity. GOO algorithm with polynomial time complexity obtains sub-optimal solutions and number of optimal solutions obtained by GOO algorithm decreases when number of relations to be joined is increased.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85048185568&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/58502
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.