Please use this identifier to cite or link to this item:
|Title:||Page access scheduling in join processing|
|Authors:||Lim, A. |
Page access scheduling
|Source:||Lim, A., Pheng, K.L., Chong, O.W. (2001). Page access scheduling in join processing. Data and Knowledge Engineering 37 (3) : 267-284. ScholarBank@NUS Repository. https://doi.org/10.1016/S0169-023X(01)00009-X|
|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. © 2001 Elsevier Science B.V.|
|Source Title:||Data and Knowledge Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.