Next:
Introduction
Efficient Batch Query Processing on R-Trees using Floating Buffers
Craig Dillabaugh
Carleton University, Ottawa, Ontario, Canada
Date:
April, 27th, 2007
Introduction
Outline
External Memory Algorithms
Notation
EM Batched Geometric Queries
Distribution Sweeping
Orthogonal Line Segment Intersection
Batch Filtering
Time Forward Processing
External Memory Priority Queue
R-Trees
R-Tree Structure
Queries
Buffered R-Tree
The Buffer-Tree
Buffered R-Tree
Floating Buffer Tree
Additional Notes on Algorithm
Source Code
Comparison
Conclusions
Bibliography
About this document ...
Craig Dillabaugh 2007-04-26
