The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Database systems: principles, programming, performance
Database systems: principles, programming, performance
GENESYS: a system for efficient spatial query processing
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Paradise: a database system for GIS applications
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A study of concurrent operations on R-trees
Information Sciences: an International Journal
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Simulation Model Design and Execution: Building Digital Worlds
Simulation Model Design and Execution: Building Digital Worlds
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
A New Methodology to Evaluate Locking Protocols
IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
| Hi-index | 0.07 |
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.