Abstract
In this paper we propose an efficient concurrency control algorithm based on the link technique of R/sup Link/-Tree for high-dimensional index structures. Unlike the R/sup Link/-Tree concurrency control algorithm, it does not employ lock-coupling while ascending the index trees to process node splits and MBR (minimum bounding region) updates. Additionally, the algorithm provides the concurrency control mechanisms for forced reinsertion operations that are used to improve search performance in multi-dimensional index trees. We show through experiments that our proposed method outperforms the existing R/sup Link/-Tree algorithm.
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.
