Approximate range searching in external memory

DOI10.1007/S00453-009-9297-0zbMath1213.68232OpenAlexW2924960238MaRDI QIDQ627532

Ke Yi, Micha Streppel

Publication date: 2 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/2d194424-f6b4-46e4-9853-b7fd9e2c21ef

zbMATH Keywords

external memory algorithmsapproximate range searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Approximate closest-point queries in high dimensions
• Guarding scenes against invasive hypercubes.
• Efficient searching with linear constraints
• Approximate range searching
• R-trees: theory and applications
• Box-trees and R-trees with near-optimal query time
• Sharp quantum versus classical query complexity separations
• Approximate range searching using binary space partitions
• Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Box-trees for collision checking in industrial installations
• The priority R-tree

This page was built for publication: Approximate range searching in external memory