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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. C. Desai, Performance of a composite attribute and join index, IEEE Trans. on Software Eng., 15 (1989), pp. 142–152.
P. Mishra and M. H. Eich, Join processing in relational databases, ACM Computing Surveys, 24 (1992), pp. 64–113.
E. R. Omiecinski, Heuristics for join processing using nonclustered indexes, IEEE Trans. Knowledge and Data Eng., 15 (1989), pp. 19–25.
B. C. Ooi and C. Y. Chan, Efficient scheduling of page access in index-based join processing, IEEE Trans. Knowledge and Data Eng., 9 (1997), pp. 1005–1011.
The Open University, Networks 3: Assignment and Transportation, walton Hall, Milton Keynes, MK7 6AA.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization-Algorithms and Complexity, Prentice Hall International, Inc, Englewood Cliffs, NJ 07632, USA, 1989.
P. Valduriez, Join indices, ACM Trans. on Database Systems, 12 (1987), pp. 218–246.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, A., Chong, O.W., Chi, C.H. (2000). A New Algorithm for Page Access Sequencing in Join Processing. In: Štuller, J., Pokorný, J., Thalheim, B., Masunaga, Y. (eds) Current Issues in Databases and Information Systems. ADBIS DASFAA 2000 2000. Lecture Notes in Computer Science, vol 1884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44472-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-44472-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67977-6
Online ISBN: 978-3-540-44472-5
eBook Packages: Springer Book Archive