Abstract
To find the nearest neighbor (NN) objects of a given point is an important query in spatial database systems. The algorithm, designed by Roussopoulos, Kelley and Vincent ( Roussopoulos et al.. Nearest neighbor queries, in: Proc. ACM SIGMOD Int. Conf. on Management of Data, 1995, pp. 71–79) and called as RKV, can only solve such a query for a single-user environment. However, the performance of RKV is low in a multi-user environment due to its depth-first search. Based on breadth-first search, an NN algorithm (called CC) with concurrency control feature is proposed for a multi-user environment. To compare the strengths and weaknesses of RKV and CC, several experiments were conducted on the efficiency of these two algorithms. The stimulation results indicate that the performance of CC is around two to sevenfold better than that of RKV under various conditions of data contention.
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.
