Kajian Optimasi Query Dengan Pendekatan Heuristik

Authors

  • Julia Kurniasih Magister Teknik Informatika, Universitas AMIKOM Yogyakarta
  • Henderi Henderi Magister Teknik Informatika, Universitas AMIKOM Yogyakarta

Keywords:

optimasi, query, heuristic

Abstract

Intisari

Semakin kompleks proses bisnis sebuah sistem, maka semakin besar pula data yang dimiliki. Proses transaksi data juga akan semakin intensif, sehingga jika tidak di optimasi dapat berdampak pada kinerja sistemnya. Proses optimasi query akan memberikan beberapa rancangan query yang akan di uji untuk mengidentifikasi dan memilih query yang paling optimal. Salah satu pendekatan optimasi yang dapat digunakan untuk melakukan optimasi query adalah pendekatan heuristic. Pendekatan heuristic akan mengubah pohon-query (query tree) dengan menggunakan seperangkat aturan (rule) yang bertujuan untuk meningkatkan kinerja eksekusi query. Query direpresentasikan ke dalam bentuk struktur data query tree dengan menggunakan algoritma optimasi query heuristic. Dengan pendekatan heuristic pada proses optimasi query akan menghasilkan jumlah tuple yang lebih sedikit dikarenakan tuple-tuple sudah dipilih sesuai dengan kondisi melalui proses transformasi aljabar relasional. Dengan jumlah tuple yang lebih sedikit maka waktu eksekusi query untuk operasi join tabel dapat menjadi lebih cepat..

 

Kata kunci—optimasi, query, heuristic

 

Abstract

 The more complex the system data, the greater the data owned. The process of data transactions will also be more intensive, if not able to optimize it can affect to the system performance. Query optimization generates some selected query algorithms to select the most optimal query. One of the optimization approach that can be used to perform query optimization is the heuristic approach. A heuristic approach optimization using a set of rules that aims to improve the quality of the execution query. The query is represented in the query tree data structure using the heuristic query optimization algorithm. The heuristic approach to the query optimization process produces a smaller number of tuples because the tuples are selected according to conditions through the relational algebra transformation process. With fewer tuples the query execution time for join table operations can become faster.

 

Keywords—optimization, query, heuristic

Downloads

Published

2019-01-03

Issue

Vol. 7 No. 2 (2018): Jurnal Dinamika Informatika

Section

Articles

License

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).