Page Access Sequencing in Join Processing with Limited Buffer Space

Abstract

When performing the join operation in relational databases, one problem involves finding the optimal page access sequence such that the number of page re-accesses is minimized, given a fixed buffer size. This paper presents a new heuristic for this problem (known as OPAS2) that generally outperforms existing heuristics.