Please use this identifier to cite or link to this item:
|Title:||Page access scheduling in join processing|
|Authors:||Lim, Andrew |
Kwan, Jennifer Lai-Pheng
|Source:||Lim, Andrew,Kwan, Jennifer Lai-Pheng,Oon, Wee-Chong (1999). Page access scheduling in join processing. International Conference on Information and Knowledge Management, Proceedings : 276-283. ScholarBank@NUS Repository.|
|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 based on the sort-merge join and the simple TID algorithm. Our experimental results show that the new heuristics perform well.|
|Source Title:||International Conference on Information and Knowledge Management, Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.