A model for k-nearest neighbor query processing cost in multidimensional data space
From MaRDI portal
Publication:294618
DOI10.1016/S0020-0190(98)00193-8zbMATH Open1339.68065MaRDI QIDQ294618FDOQ294618
Authors: Ju-Hong Lee, Guang-Ho Cha, Chin-Wan Chung
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001938?np=y
Recommendations
- scientific article; zbMATH DE number 2080488
- Estimating the performance of multidimensional access methods based on nonoverlapping regions
- scientific article; zbMATH DE number 1830741
- Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
- scientific article; zbMATH DE number 1953852
Cited In (3)
This page was built for publication: A model for \(k\)-nearest neighbor query processing cost in multidimensional data space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294618)