A Genetic Algorithm for Minimizing Query Processing Time in Distributed Database Design: Total Time Versus Response Time


The KIPS Transactions:PartD, Vol. 16, No. 3, pp. 295-306, Jun. 2009
10.3745/KIPSTD.2009.16.3.295,   PDF Download:

Abstract

Query execution time minimization is an important objective in distributed database design. While total time minimization is an objective for On Line Transaction Processing (OLTP), response time minimization is for Decision Support queries. We formulate the sub-query allocation problem using analytical models and solve with genetic algorithm (GA). We show that query execution plans with total time minimization objective are inefficient from response time perspective and vice versa. The procedure is tested with simulation experiments for queries of up to 20 joins. Comparison with exhaustive enumeration indicates that GA produced optimal solutions in all cases in much less time.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. K. Song, "A Genetic Algorithm for Minimizing Query Processing Time in Distributed Database Design: Total Time Versus Response Time," The KIPS Transactions:PartD, vol. 16, no. 3, pp. 295-306, 2009. DOI: 10.3745/KIPSTD.2009.16.3.295.

[ACM Style]
Suk Kyu Song. 2009. A Genetic Algorithm for Minimizing Query Processing Time in Distributed Database Design: Total Time Versus Response Time. The KIPS Transactions:PartD, 16, 3, (2009), 295-306. DOI: 10.3745/KIPSTD.2009.16.3.295.