Abstract
We introduce an improved method to split overflowed nodes of R-tree spatial index called the Corner Based Splitting (CBS) algorithm. Good splits produce an efficient R-tree which has minimal height, overlap and coverage in each node. The CBS algorithm selects the splitting axis that produces the most even split according to the number of objects, using the distance from each object centre to the nearest node’s MBR corner. Experiments performed using both synthetic and real data files showed obvious performance improvement. The improvement percentage over the Quad algorithm reached 23%, while the improvement percentage over the NR algorithm reached 37%.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
