Abstract
The implementation of an access method in a commercial DBMS or a research prototype raises many issues that must be considered to provide effective and efficient access to the underlying data. An access method is useless unless it can be efficiently implemented in real-life data intensive applications. Making the access method part of a larger (usually multiuser) system is not an easy task. The access method must be adjusted to the underlying system architecture and therefore issues like concurrency control and parallelism must be handled carefully. In this chapter, we discuss implementation issues regarding the Rtree access method. More specifically, we investigate the following topics:
-
the adjustment of the R-tree to parallel architectures,
-
the management of concurrent accesses, and
-
R-tree implementations in research prototypes and commercial systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag London Limited
About this chapter
Cite this chapter
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y. (2006). Implementation Issues. In: R-Trees: Theory and Applications. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84628-293-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-84628-293-5_9
Publisher Name: Springer, London
Print ISBN: 978-1-85233-977-7
Online ISBN: 978-1-84628-293-5
eBook Packages: Computer ScienceComputer Science (R0)