Processing constrainedK closest pairs query in spatial databases
From MaRDI portal
Recommendations
Cites work
Cited in
(5)- A new plane-sweep algorithm for the K-closest-pairs query
- Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
- Evaluation of buffer queries in spatial databases (extended abstract)
- Constrained nearest neighbor queries
- The impact of buffering on closest pairs queries using R-trees
This page was built for publication: Processing constrainedK closest pairs query in spatial databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492512)