Geometric and Spatial Data Structures in External Memory
Jeffrey Scott Vitter
The University of Mississippi
Disk Model•Design Criteria for EM Data Structures•Overview of Chapter
28.2EM Algorithms for Batched Geometric Problems
B-trees and Variants•Weight-Balanced B-trees•Parent Pointers and Level-Balanced B-trees•Buffer Trees
28.4Spatial Data Structures and Range Search
Linear-Space Spatial Structures•R-trees•Bootstrapping for 2-D Diagonal Corner and Stabbing Queries•Bootstrapping for Three-Sided Orthogonal 2-D Range Search•General Orthogonal 2-D Range Search•Lower Bounds for Orthogonal Range Search
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
