Abstract

Spatial index has been one of the active focus areas in recent database research. The R-tree proposed by Guttman is probably the most popular dynamic index structure for efficiently retrieving objects from a spatial database according to their spatial locations. This paper proposes a new method of constructing R-tree by studying every kind of its operations thoroughly and combining with improved k-medoids clustering algorithm. Because of its more compact structure, the R-tree based on this method has more advantages compared with traditional R-tree. The results of the study show that, due to the optimization of structure, the proposed method can improve index efficiency effectively.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.