Efficient parallelization of spatial approximation trees
From MaRDI portal
Recommendations
- Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
- d-dimensional range search on multicomputers
- An Index Data Structure for Searching in Metric Space Databases
- Range search in parallel using distributed data structures
- The FX distribution method for parallel processing of partial match queries
Cited in
(6)- Parallel query processing on distributed clustering indexes
- Solving similarity joins and range queries in metric spaces with the list of twin clusters
- scientific article; zbMATH DE number 3876584 (Why is no real title available?)
- Use of the spatial kD-tree in computational physics applications
- Load balancing in distributed point cloud databases
- Sync/Async parallel search for the efficient design and construction of web search engines
This page was built for publication: Efficient parallelization of spatial approximation trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709498)