Name
Abstract | ||
|---|---|---|
Access to spatial objects is often required in many nonstandard database applications, such as GIS, VLSI and CAD. In this paper, we examine the R-tree as an index structure, and modify it to allow concurrent accesses. We investigate three different locking methods for concurrency control. The first method uses a single lock to lock the entire tree, allowing concurrent searches but only sequential updates. The second method locks the whole tree only when the splitting or merging of nodes in the tree is required. The third method uses the lock-coupling technique to lock individual nodes of the tree. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-56869-7_9 | SSD |
Keywords | DocType | ISBN |
concurrent access | Conference | 3-540-56869-7 |
Citations | PageRank | References |
15 | 3.30 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent T. Y. Ng | 1 | 504 | 122.85 |
| Tiko Kameda | 2 | 638 | 224.17 |