A Buffer Model for Evaluating the Performance of R-Tree Packing Algorithms

Abstract

Performance studies of various R-tree algorithms, have used the number of nodes accessed as the primary metric. In real databases some portion of the tree is buffered in main memory. Since such buffering can significantly affect performance, we postulate that performance prediction should be baaed on number of 1/0s required to satisfy a query. To this end… (More)
DOI: 10.1145/233013.233054

Topics

1 Figure or Table

Slides referencing similar topics