Scheduling of page fetches in join operations using B/sub c/-trees

The authors consider B/sub c/-trees in a centralized system with large main memory, and show that in some cases the join operation using B/sub c/-trees out performs other join techniques. The results can be used for estimating the cost of join using B/sub c/-trees and then making a decision regarding the most efficient join technique to be used.<
>