Comparative Analysis of R-Tree and R -Tree in Spatial Database
S. Srividhya, S.R. Lavanya
Abstract
S. Srividhya, S.R. Lavanya
Abstract
A spatial preference query ranks the objects based on the quality of features in their spatial neighborhood. There are several indexing techniques used in the past for storage and retrieval of spatial data. In this approach, suitable indexing techniques has been applied for multi dimensional spatial objects. A spatial model has been designed using R Tree and R+-Tree, with real estate dimensional spaces using spatial objects where data is organized in the form of three dimensional grid. The experimental results proved that R+-Tree algorithm outperforms R-Tree in ranking the spatial objects when compared to R- tree algorithm.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A spatial preference query ranks the objects based on the quality of features in their spatial neighborhood. There are several indexing techniques used in the past for storage and retrieval of spatial data. In this approach, suitable indexing techniques has been applied for multi dimensional spatial objects. A spatial model has been designed using R Tree and R+-Tree, with real estate dimensional spaces using spatial objects where data is organized in the form of three dimensional grid. The experimental results proved that R+-Tree algorithm outperforms R-Tree in ranking the spatial objects when compared to R- tree algorithm.
Key concepts: Search engine indexing, R-tree, Computer science, Tree (set theory), Ranking (information retrieval), Spatial analysis, Data mining, Spatial database