Page Access Scheduling in Join Processing

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 bu€er pages without any page reaccesses, and (2) determining a page access sequence that minimizes the number of page reaccesses for a given bu€er 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. All rights reserved.

• Type: Conference
• Year: 1999
• Where: CIKM
• Authors: Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon
• Keywords: CIKM 1999, Information Management, Join Relational Operation, Page Access Sequence, Pages