Approximate range searching in external memory
From MaRDI portal
Publication:627532
DOI10.1007/S00453-009-9297-0zbMATH Open1213.68232OpenAlexW2924960238MaRDI QIDQ627532FDOQ627532
Authors: Micha Streppel, Ke Yi 
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
Recommendations
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- The design of dynamic data structures
- Efficient searching with linear constraints
- Approximate range searching using binary space partitions
- Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
- Approximate closest-point queries in high dimensions
- Sharp quantum versus classical query complexity separations
- Guarding scenes against invasive hypercubes.
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Approximate range searching
- R-trees: theory and applications
- Box-trees and R-trees with near-optimal query time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Box-trees for collision checking in industrial installations
Cited In (7)
- Approximate Range Searching in External Memory
- Maximizing Range Sum in External Memory
- Efficient external memory structures for range-aggregate queries
- Approximate range searching using binary space partitions
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Approximate range searching
- Approximate Range Searching: The Absolute Model
This page was built for publication: Approximate range searching in external memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627532)
