Please use this identifier to cite or link to this item:
|Title:||Pipelining in multi-query optimization|
|Authors:||DALVI, NILESH N|
SANGHAI, SUMIT K
|Citation:||Journal of Computer and System Sciences 66(4), 728-762|
|Abstract:||Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plans that share common results. Current approaches to multi-query optimization assume that common subexpressions are materialized. Significant performance benefits can be had if common subexpressions are pipelined to their uses, without being materialized. However, plans with pipelining may not always be realizable with limited buffer space, as we show. We present a general model for schedules with pipelining, and present a necessary and sufficient condition for determining validity of a schedule under our model. We show that finding a valid schedule with minimum cost is NP-hard. We present a greedy heuristic for finding good schedules. Finally, we present a performance study that shows the benefit of our algorithms on batches of queries from the TPCD benchmark.|
|Appears in Collections:||Article|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.