High-Concurrency Locking in R-Trees

@inproceedings{Kornacker1995HighConcurrencyLI,
  title={High-Concurrency Locking in R-Trees},
  author={Marcel Kornacker and Douglas Banks},
  booktitle={VLDB},
  year={1995}
}
In this paper we present a solution to the problem of concurrent operations in R-trees, a dynamic access structure capable of storing multidimensional and spatial data. We describe the R-link tree, a variant of the R-tree that adds sibling pointers to nodes, a technique rst deployed in B-link trees, to compensate for concurrent structure modi cations. The main obstacle to the use of sibling pointers is the lack of linear ordering among the keys in an R-tree; we overcome this by assigning… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 57 CITATIONS, ESTIMATED 31% COVERAGE

186 Citations

051015'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 186 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Yao

  • S P. Lehman
  • \E cient Locking for Concurrent Operations on B…
  • 1981
Highly Influential
4 Excerpts

Kameda

  • T V. Ng
  • \Concurrent Accesses to R-Trees," Proceedings of…
  • 1993
1 Excerpt

Shasha

  • D T. Johnson
  • \The Performance of Current B-Tree Algorithms…
  • 1993

Levine

  • F C. Mohan
  • \ARIES/IM: An E cient and High Concurrency Index…
  • 1992
1 Excerpt

Salzberg

  • B D. Lomet
  • \The hB-Tree: A Multiattribute Indexing Method…
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…