R++-tree: An efficient spatial access method for highly redundant point data

Abstract

We present a new spatial index belonging to R-tree family. Since our new index comes out from the R+-tree and holds the concept of non-overlapping nodes we call it R++-tree. The original R+-tree was designed for both point and spatial data. Using R+-tree for indexing spatial data is very inefficient. In our research we face the problem of indexing product catalogues data that can be represented as point data. Therefore we suggested the R++-tree for point data only. We present a dynamic index R++-tree as an improvement of R+-tree. In the tests we show that R++-tree offers even better search efficiency than R ∗ -tree when highly redundant point data is considered. Moreover the construction time of R++-tree is shorter than the construction time of R∗-tree.