Issue No. 06 - December (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.476495
<p><it>Abstract</it>—In this research, we address the query clustering problem which involves determining globally optimal execution strategies for a set of queries. The need to process a set of queries together often arises in deductive database systems, scientific database systems, large bibliographic retrieval systems and several other database applications. We address the optimization problem from the perspective of overlaps in data requirements, and model the batched operations using a set-partitioning approach In this model, we first consider the case of <it>m</it> queries each involving a two-way join operation. We develop a recursive methodology to determine all the processing strategies in this case. Next, we establish certain dominance properties among the strategies, and develop exact as well as heuristic algorithms for selecting an appropriate strategy. We extend this analysis to a clustering approach, and outline a framework for optimizing multiway joins. The results show that the proposed approach is viable and efficient, and can easily be incorporated into the query processing component of most database systems.</p>
Batch processing, clustering techniques, combinatorial optimization, join operator, query clustering relational databases, set partitions.
R. D. Gopal and R. Ramesh, "The Query Clustering Problem: A Set Partitioning Approach," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 885-899, 1995.