doi:10.1016/S0169-023X(01)00009-X 
Copyright © 2001 Elsevier Science B.V. All rights reserved.
Page access scheduling in join processing
Department of Computer Science, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore
Received 1 July 1999;
revised 23 January 2000;
accepted 20 November 2000
Available online 25 May 2001.
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Abstract
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This raises two interesting problems: (1) determining a page access sequence that uses the minimum number of buffer pages without any page reaccesses, and (2) determining a page access sequence that minimizes the number of page reaccesses for a given buffer size. We use a graph model to represent the pages from the relations that contain tuples to be joined, and present new heuristics for the two problems. Our experimental results show that the new heuristic performs well.
Author Keywords: Graph models; Heuristics; Join processing; Page access scheduling
Fig. 1. The overall search strategy.
Fig. 2. (a) Absolute performance improvement of the new OPAS2 heuristic for general graphs with 500 vertices and edge ratio 5%; (b) percentage performance improvement of the new OPAS2 heuristic for general graphs with 500 vertices and edge ratio 5%.
Fig. 3. (a) Absolute performance improvement of the new OPAS2 heuristic for geometric graphs with 500 vertices and expected degree of each vertex is 25; (b) percentage performance improvement of the new OPAS2 heuristic for geometric graphs with 500 vertices and expected degree of each vertex is 25.
Fig. 4. (a) Absolute performance improvement of the new OPAS2 heuristic for bipartite graphs with 250 + 250 vertices and edge ratio 5%; (b) percentage performance improvement of the new OPAS2 heuristic for bipartite graphs with 250 + 250 vertices and edge ratio 5%.
Fig. 5. (a) Absolute performance improvement of the new OPAS2 heuristic for bipartite graphs with 200 + 400 vertices and edge ratio 5%; (b) percentage performance improvement of the new OPAS2 heuristic for bipartite graphs with 200 + 400 vertices and edge ratio 5%.
Table 1. Performance improvement of the new OPAS1 heuristic for general graphs
Table 2. Performance improvement of the new OPAS1 heuristic for geometric graphs
Table 3. Performance improvement of the new OPAS1 heuristic for bipartite graphs where |V1|=|V2|
Table 4. Performance improvement of the new OPAS1 heuristic for bipartite graphs where |V1|<|V2|
Abstract
Purchase PDF (465 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (309 K)
