Dynamic programming solution for multiple query optimization problem

2004-11-15
Toroslu, İsmail Hakkı
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
64
views
0
downloads
Databases, Query processing, Multiple query optimization, Dynamic programming algorithm
https://hdl.handle.net/11511/41533
INFORMATION PROCESSING LETTERS
Department of Computer Engineering, Article

Suggestions

Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Database Queries
Dokeroglu, Tansel; Coşar, Ahmet (2011-09-28)
In this paper, we introduce and evaluate a new query optimization algorithm based on Dynamic Programming (DP) and Ant Colony Optimization (ACO) metaheuristic for distributed database queries. DP algorithm is widely used for relational query optimization, however its memory, and time requirements are very large for the query optimization problem in a distributed database environment which is an NP-hard combinatorial problem. Our aim is to combine the power of DP with heuristic approaches so that we can have ...
Oblivious video watermaking using temporal sensitivity of HVS
Koz, A; Alatan, Abdullah Aydın (2004-04-30)
An oblivious video watermarking method is presented based on the temporal sensitivity of Human Visual System (HVS). The method exploits the temporal contrast thresholds of HVS to determine the maximum strength of watermark, which still gives imperceptible distortion after watermark insertion. Compared to other approaches in the literature, the method guarantees to avoid flickering problem in the watermarked video and gives better robustness results to video distortions, such as additive Gaussian noise, H.26...
Using object-oriented materialized views to answer selection-based complex queries
Alhajj, R; Polat, Faruk (1999-09-01)
Presented in this paper is a model that utilizes existing materialized views to handle a wide range of complex selection-based queries, including linear recursive queries. Such queries are complex because it is almost impossible for naive users to predict the formulation of their predicate expressions. Object variables bound to objects in the result of a query are allowed to appear in the predicate of that query. Also, the predicate definition is extended to make it possible to have in the output only a sub...
Integer Linear Programming Solution for the Multiple Query Optimization Problem
Dokeroglu, Tansel; Bayir, Murat Ali; Coşar, Ahmet (2014-10-28)
Multiple Query Optimization (MQO) is a technique for processing a batch of queries in such a way that shared tasks in these queries are executed only once, resulting in significant savings in the total evaluation. The first phase of MQO requires producing alternative query execution plans so that the shared tasks between queries are identified and maximized. The second phase of MQO is an optimization problem where the goal is selecting exactly one of the alternative plans for each query to minimize the tota...
Genetic algorithm for the multiple-query optimization problem
Bayir, Murat Ali; Toroslu, İsmail Hakkı; Coşar, Ahmet (2007-01-01)
Producing answers to a set of queries with common tasks efficiently is known as the multiple-query optimization (MQO) problem. Each query can have several alternative evaluation plans, each with a different set of tasks. Therefore, the goal of MQO is to choose the right set of plans for queries which minimizes the total execution time by performing common tasks only once. Since MQO is an NP-hard problem, several, mostly heuristics based, solutions have been proposed for solving it. To the best of our knowle...
Citation Formats
İ. H. Toroslu, “Dynamic programming solution for multiple query optimization problem,” INFORMATION PROCESSING LETTERS, pp. 149–155, 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41533.
METU IIS - Integrated Information Service open@metu.edu.tr