Skip to main content
Conference Proceedings

The R-link tree: A recoverable index Structure for spatial data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 856 LNCS 163-172
DOI: 10.1007/3-540-58435-8_181
15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

So far, R-trees have been investigated for use in the single-user environment. We use the link technique proposed by Kung and Lehman to support concurrent operations (search, insert, and delete) on an R-tree. We present algorithms for implementing these operations, and also discuss recovery issues in case of failure.

Cite

CITATION STYLE

APA

Ng, V., & Kameda, T. (1994). The R-link tree: A recoverable index Structure for spatial data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 856 LNCS, pp. 163–172). Springer Verlag. https://doi.org/10.1007/3-540-58435-8_181

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free