R-Trees: Theory and Applications: Theory and ApplicationsSpace support in databases poses new challenges in every part of a database management system & 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 & efficient management of spatial objects. 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. |
Contents
IV | 3 |
V | 7 |
VI | 13 |
VII | 15 |
IX | 18 |
X | 20 |
XI | 22 |
XII | 24 |
XLII | 93 |
XLIII | 94 |
XLIV | 99 |
XLVI | 101 |
XLVIII | 102 |
XLIX | 103 |
L | 104 |
LI | 105 |
XIII | 25 |
XIV | 27 |
XVI | 29 |
XVII | 34 |
XVIII | 35 |
XX | 36 |
XXI | 37 |
XXII | 38 |
XXIII | 40 |
XXIV | 42 |
XXV | 44 |
XXVI | 45 |
XXVIII | 47 |
XXIX | 51 |
XXXI | 53 |
XXXII | 55 |
XXXIII | 62 |
XXXIV | 68 |
XXXV | 69 |
XXXVII | 72 |
XXXVIII | 77 |
XXXIX | 80 |
XL | 85 |
XLI | 87 |