R-Trees: Theory and Applications

  • Yannis Manolopoulos
  • Alexandros Nanopoulos
  • Apostolos N. Papadopoulos
  • Yannis Theodoridis

Part of the Advanced Information and Knowledge Processing book series (AI&KP)

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Fundamental Concepts

    1. Front Matter
      Pages 1-1
    2. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 3-13
    3. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 15-34
    4. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 35-48
  3. Query Processing Issues

    1. Front Matter
      Pages 49-49
    2. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 51-68
    3. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 69-95
  4. R-Trees In Modern Applications

    1. Front Matter
      Pages 97-97
    2. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 99-115
    3. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 117-130
  5. Advanced Issues

    1. Front Matter
      Pages 131-131
    2. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 133-150
    3. Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis
      Pages 151-171
  6. Back Matter
    Pages 173-194

About this book

Introduction

Nowadays, a significant number of applications require the organization of data elements which contain at least one spatial attribute. Space support in databases poses new challenges in every part of a database management system and the capability of spatial support in the physical layer is considered very important. This has led to the design of spatial access methods to enable the effective and efficient management of spatial objects.

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. Based on the observation that ``space is everywhere", the authors anticipate that we are in the beginning of the era of the ``ubiquitous R-tree" analogous to the way B-trees were considered 25 years ago. Written for database researchers, designers and programmers as well as graduate students, this comprehensive monograph will be a welcome addition to the field.

 

The book successfully integrates research results of the last 20 years, in a clear and highly readable manner. It is the first book dedicated to R-trees and related access methods, and I believe it will be valuable as a reference to everyone interested in the area.

Prof. Timos Sellis, National Technical University of Athens

Keywords

Access Methods Database Management Query Processing R-Trees Spatial Databases concurrency database

Authors and affiliations

  • Yannis Manolopoulos
    • 1
  • Alexandros Nanopoulos
    • 1
  • Apostolos N. Papadopoulos
    • 1
  • Yannis Theodoridis
    • 2
  1. 1.Aristotle University of ThessalonikiGreece
  2. 2.University of Piraeus & Computer Technology InstituteGreece

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-84628-293-5
  • Copyright Information Springer-Verlag London 2006
  • Publisher Name Springer, London
  • eBook Packages Computer Science
  • Print ISBN 978-1-85233-977-7
  • Online ISBN 978-1-84628-293-5
  • Series Print ISSN 1610-3947
  • About this book