R-Trees: Theory and Applications: Advanced Information and Knowledge Processing
Autor Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridisen Limba Engleză Paperback – 2 ian 2013
R-trees have a simplicity of structure & 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 & its variations to efficient query processing, accurate proposed cost models, & implementation issues like concurrency control and parallelism. Written for database researchers, designers & programmers as well as graduate students, this comprehensive monograph will be a welcome addition to the field.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 963.09 lei 43-57 zile | |
SPRINGER LONDON – 2 ian 2013 | 963.09 lei 43-57 zile | |
Hardback (1) | 966.51 lei 43-57 zile | |
SPRINGER LONDON – 21 noi 2005 | 966.51 lei 43-57 zile |
Din seria Advanced Information and Knowledge Processing
- 20% Preț: 330.42 lei
- 20% Preț: 52.35 lei
- 20% Preț: 1021.15 lei
- 18% Preț: 712.15 lei
- 20% Preț: 633.21 lei
- 20% Preț: 970.73 lei
- 20% Preț: 634.50 lei
- 20% Preț: 976.35 lei
- 20% Preț: 974.25 lei
- 20% Preț: 965.06 lei
- 20% Preț: 641.13 lei
- 20% Preț: 969.72 lei
- 20% Preț: 971.19 lei
- 15% Preț: 632.73 lei
- 20% Preț: 801.01 lei
- 20% Preț: 971.36 lei
- 18% Preț: 1092.23 lei
- 20% Preț: 589.92 lei
- 20% Preț: 975.57 lei
- Preț: 445.77 lei
- 20% Preț: 972.49 lei
- 20% Preț: 632.08 lei
- 20% Preț: 634.50 lei
- 20% Preț: 625.78 lei
- 18% Preț: 935.73 lei
- 20% Preț: 630.95 lei
- 20% Preț: 632.26 lei
- 18% Preț: 931.71 lei
- 20% Preț: 902.50 lei
- 20% Preț: 640.49 lei
- 20% Preț: 967.97 lei
- 18% Preț: 928.46 lei
- 20% Preț: 984.62 lei
- 20% Preț: 637.75 lei
- 20% Preț: 977.99 lei
- 20% Preț: 629.65 lei
- 20% Preț: 967.97 lei
- 20% Preț: 977.17 lei
- 20% Preț: 637.42 lei
- 20% Preț: 634.50 lei
Preț: 963.09 lei
Preț vechi: 1203.87 lei
-20% Nou
Puncte Express: 1445
Preț estimativ în valută:
184.32€ • 191.46$ • 153.10£
184.32€ • 191.46$ • 153.10£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781849969864
ISBN-10: 1849969868
Pagini: 216
Ilustrații: XIX, 194 p. 77 illus.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.31 kg
Ediția:2006
Editura: SPRINGER LONDON
Colecția Springer
Seria Advanced Information and Knowledge Processing
Locul publicării:London, United Kingdom
ISBN-10: 1849969868
Pagini: 216
Ilustrații: XIX, 194 p. 77 illus.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.31 kg
Ediția:2006
Editura: SPRINGER LONDON
Colecția Springer
Seria Advanced Information and Knowledge Processing
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
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.
Recenzii
From the reviews:
"The book contains nine chapters (divided into four parts), an epilogue, a reference section, and an index, in addition to the preface and list of figures and tables. … The book is written in a very informal and user-friendly manner with lots of examples, illustrations, and tables. The authors have succeeded in making this book very accessible, understandable, and readable. This book will be invaluable to professionals, researchers, teachers, and students who deal with spatial data management systems and their access methods." (Alexis Lean, Computing Reviews, December, 2006)
"The book contains nine chapters (divided into four parts), an epilogue, a reference section, and an index, in addition to the preface and list of figures and tables. … The book is written in a very informal and user-friendly manner with lots of examples, illustrations, and tables. The authors have succeeded in making this book very accessible, understandable, and readable. This book will be invaluable to professionals, researchers, teachers, and students who deal with spatial data management systems and their access methods." (Alexis Lean, Computing Reviews, December, 2006)
Textul de pe ultima copertă
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
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
Caracteristici
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