A New Algorithm for Page Access Sequencing in Join Processing
One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which requires the minimum number of buffer pages if there are no page reaccesses, and 2) finding a page access sequence which requires the minimum number of page reaccesses given a fixed buffer size. In general, a heuristic for the first problem can be converted to a corresponding heuristic to the second problem.
In this paper, a new heuristic is proposed. The experimental results show that the new heuristic performs significantly better than existing heuristics for data which is modelled with geometric graphs, and no worse in others, for the first problem. It performs similarly better for the second problem if the fixed buffer size is not much less than the maximum buffer size generated in the first problem.
KeywordsBipartite Graph General Graph Maximum Match Geometric Graph Runtime Complexity
Unable to display preview. Download preview PDF.
- 5.The Open University, Networks 3: Assignment and Transportation, walton Hall, Milton Keynes, MK7 6AA.Google Scholar
- 6.C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization-Algorithms and Complexity, Prentice Hall International, Inc, Englewood Cliffs, NJ 07632, USA, 1989.Google Scholar