Concurrent access to point data

Authors:
Vincent Ng;Tiko Kameda
Affiliations:
-;-
Venue:
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Year:
1997

Citing 5
Cited 0

Multiattribute hashing using Gray codes

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures

The design and analysis of spatial data structures
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Techniques for Design and Implementation of Efficient Spatial Access Methods

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

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.