Nowadays, a significant number of applications require the organization of data elements that contain at least one spatial attribute. R-trees have a simplicity of structure and, together with their resemblance to the B-tree, allow developers to incorporate them easily into existing database management systems for the support of spatial query processing. This book provides an extensive survey of the R-tree evolution, studying the applicability of the structure and its variations to efficient query processing, accurate proposed cost models, and implementation issues like concurrency control and parallelism.

The first comprehensive study on R-trees Not limited to a single application By presenting the specific application domains that each R-tree variant is applied, the authors help the reader to understand each variation and to select a proper variation according to their needs Discussion of various cost models and the implementation details of the methods Experimental results included for comparison of the various methods used as well as qualitative comparisons Includes supplementary material: sn.pub/extras

Inhalt
Fundamental Concepts.- Dynamic Versions of R-trees.- Static Versions of R-trees.- Query Processing Issues.- Fundamental Query Processing Techniques.- Processing More Complex Queries.- R-Trees In Modern Applications.- R-trees in Spatiotemporal Databases.- R-trees for Multimedia, Warehousing and Mining.- Advanced Issues.- Query Optimization Issues.- Implementation Issues.