Skip to Main content Skip to Navigation
Conference papers

Scaling KNN Computation over Large Graphs on a PC

Nitin Chiluka 1 Anne-Marie Kermarrec 1 Javier Olivares 1
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : This paper proposes a novel approach to compute K-Nearest Neighbors (KNN) algorithm on a large set of users by lever-aging disk and memory efficiently on a commodity PC. The system is designed to minimize random accesses to disk as well as the amount of data loaded/unloaded from/to disk so as to better utilize the computational power, thus improving the algorithmic efficiency.
Document type :
Conference papers
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-01095557
Contributor : Javier Olivares <>
Submitted on : Thursday, December 18, 2014 - 1:48:40 PM
Last modification on : Thursday, January 7, 2021 - 4:33:39 PM
Long-term archiving on: : Monday, March 23, 2015 - 1:20:38 PM

File

Chiluka-Kermarrec-Olivares.pdf
Files produced by the author(s)

Identifiers

Citation

Nitin Chiluka, Anne-Marie Kermarrec, Javier Olivares. Scaling KNN Computation over Large Graphs on a PC. Middleware 2014, Dec 2014, Bourdeaux, France. ⟨10.1145/2678508.2678513⟩. ⟨hal-01095557⟩

Share

Metrics

Record views

413

Files downloads

428