Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0164-1212(01)00076-0
Title: A matching-based algorithm for page access sequencing in join processing
Authors: Lim, A. 
Chong, O.W. 
Chi-Hung, C. 
Keywords: Graph models
Heuristics
Join processing
Page access sequencing
Issue Date: 2002
Source: Lim, A., Chong, O.W., Chi-Hung, C. (2002). A matching-based algorithm for page access sequencing in join processing. Journal of Systems and Software 60 (1) : 11-19. ScholarBank@NUS Repository. https://doi.org/10.1016/S0164-1212(01)00076-0
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. © 2002 Elsevier Science Inc. All rights reserved.
Source Title: Journal of Systems and Software
URI: http://scholarbank.nus.edu.sg/handle/10635/39038
ISSN: 01641212
DOI: 10.1016/S0164-1212(01)00076-0
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

49
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.