Paper Info
Title
Concurrent access to point data
Abstract
The B/sup +/-tree, R-tree and K-D-B tree have been proposed as the index structures for point data in a d-dimensional space. We apply the lock coupling technique to them to allow concurrent accesses. We discuss the two common user operations, search and insert, and present concurrency control algorithms for them. We have implemented these concurrency control algorithms in the SR distributed programming language. We report on our preliminary results comparing their relative performance.
Year
DOI
Venue
1997
10.1109/CMPSAC.1997.625000
International Computer Software and Applications Conference
Keywords
Field
DocType
concurrent access,preliminary result,lock coupling technique,common user operation,concurrency control algorithm,present concurrency control algorithm,index structure,point data,k-d-b tree,d-dimensional space,b tree,strontium,tree data structures,r tree,concurrent computing,concurrency control,insert
Isolation (database systems),Programming language,Concurrency control,Computer science,Lock (computer science),Parallel computing,Tree (data structure),Multiversion concurrency control,Real-time computing,Distributed concurrency control,K-D-B-tree,Non-lock concurrency control
Conference
ISSN
ISBN
Citations 
0730-3157
0-8186-8105-5
0
PageRank 
References 
Authors
0.34
4
2
Name
Order
Citations
PageRank
Vincent T. Y. Ng1504122.85
Tiko Kameda2638224.17