Title :
Concurrent access to point data
Author :
Ng, Vincent ; Kameda, Tiko
Author_Institution :
Dept. of Comput., Hong Kong Polytech., Kowloon, Hong Kong
Abstract :
The B+-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
Keywords :
concurrency control; parallel languages; tree data structures; trees (mathematics); B+-tree; K-D-B tree; R-tree; SR distributed programming language; common user operations; concurrency control algorithms; concurrent access; concurrent accesses; d-dimensional space; index structures; insert; lock coupling technique; point data; relative performance; search; Concurrency control; Concurrent computing; Reflective binary codes; Spatial databases; Strontium; Tree data structures;
Conference_Titel :
Computer Software and Applications Conference, 1997. COMPSAC '97. Proceedings., The Twenty-First Annual International
Conference_Location :
Washington, DC
Print_ISBN :
0-8186-8105-5
DOI :
10.1109/CMPSAC.1997.625000
