Name
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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0169-023X(01)00009-X | International Conference on Information and Knowledge Management |
Keywords | Field | DocType |
page access scheduling,heuristics | Hash join,Recursive join,Tuple,Computer science,Sort-merge join,Theoretical computer science,Page replacement algorithm,Heuristics,Page fault,Block nested loop | Journal |
Volume | Issue | ISSN |
37 | 3 | 0169-023X |
ISBN | Citations | PageRank |
1-58113-146-1 | 1 | 0.38 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Lim | 1 | 373 | 21.86 |
| Jennifer Lai-Pheng Kwan | 2 | 1 | 0.38 |
| Wee-chong Oon | 3 | 111 | 12.72 |