loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Tarcizio Alexandre Bini ; Adriano Lange ; Marcos Sfair Sunye ; Fabiano Silva and Eduardo Cunha de Almeida

Affiliation: Federal University of Paraná, Brazil

Keyword(s): Query optimization, Join ordering, Randomized algorithms, Genetic algorithms.

Related Ontology Subjects/Areas/Topics: Databases and Information Systems Integration ; Enterprise Information Systems ; Performance Evaluation and Benchmarking ; Query Languages and Query Processing

Abstract: In relational database systems the optimization of select-project-join queries is a combinatorial problem. The use of exhaustive search methods is prohibitive because of the exponential increase of the search space. Randomized searches are used to find near optimal plans in polynomial time. In this paper, we investigate the large join query optimization (LJQO) problem by extending randomized algorithms and implementing a 2PO algorithm as a query optimizer in a popular open-source DBMS. We compare our solution with an implementation of a genetic algorithm. Through a multidimensional test schema, we discuss pros and cons about the behavior of these algorithms. Our results show that 2PO algorithm is fast to run and the costs of generated plans are better in most cases when compared to those of the genetic algorithms.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.80.129.195

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Alexandre Bini, T.; Lange, A.; Sfair Sunye, M.; Silva, F. and Cunha de Almeida, E. (2011). NON-EXHAUSTIVE JOIN ORDERING SEARCH ALGORITHMS FOR LJQO. In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS; ISBN 978-989-8425-53-9; ISSN 2184-4992, SciTePress, pages 151-156. DOI: 10.5220/0003426501510156

@conference{iceis11,
author={Tarcizio {Alexandre Bini}. and Adriano Lange. and Marcos {Sfair Sunye}. and Fabiano Silva. and Eduardo {Cunha de Almeida}.},
title={NON-EXHAUSTIVE JOIN ORDERING SEARCH ALGORITHMS FOR LJQO},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS},
year={2011},
pages={151-156},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003426501510156},
isbn={978-989-8425-53-9},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 2: ICEIS
TI - NON-EXHAUSTIVE JOIN ORDERING SEARCH ALGORITHMS FOR LJQO
SN - 978-989-8425-53-9
IS - 2184-4992
AU - Alexandre Bini, T.
AU - Lange, A.
AU - Sfair Sunye, M.
AU - Silva, F.
AU - Cunha de Almeida, E.
PY - 2011
SP - 151
EP - 156
DO - 10.5220/0003426501510156
PB - SciTePress