A New Algorithm for Page Access Sequencing in Join Processing

Authors:
Andrew Lim;O. W. Chong;Chi-Hung Chi
Affiliations:
-;-;-
Venue:
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Year:
2000

Citing 6
Cited 0

Join indices

ACM Transactions on Database Systems (TODS)
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Performance of a Composite Attribute and Join Index

IEEE Transactions on Software Engineering
Heuristics for Join Processing Using Nonclustered Indexes

IEEE Transactions on Software Engineering
Join processing in relational databases

ACM Computing Surveys (CSUR)
Efficient Scheduling of Page Access in Index-Based Join Processing

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.