Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 1984

R-trees

View Full Paper
Ask AI
Bookmark
Share

Authors

AGAntonin Guttman

Discussion

Loading...

Member takes

Overview

The paper describes an R-tree structure for efficient spatial data indexing in database systems, suggesting improved retrieval performance.

Key Points

  • This research aims to introduce an R-tree index structure to efficiently handle spatial data retrieval in database systems.
  • Developed a dynamic index structure called an R-tree for spatial data.
  • Provided algorithms for searching and updating the R-tree.
  • Conducted tests to evaluate the performance of the R-tree structure.
  • The R-tree structure showed improved performance in retrieving spatial data items.
  • Tests indicated that the structure efficiently handles non-zero size data objects in multi-dimensional spaces.

Cite This Study

Antonin Guttman (1984) studied this question.

synapsesocial.com/papers/69de5e4b7ed287395e558a3chttps://doi.org/10.1145/602259.602266
View Full Paper
Ask AI
Bookmark
Share