Parallel kNN Query Processing Algorithm Supporting Privacy Preservation 


Vol. 13,  No. 11, pp. 628-636, Nov.  2024
https://doi.org/10.3745/TKIPS.2024.13.11.628


PDF
  Abstract

This paper proposes a privacy-preserving parallel kNN query processing algorithm that utilizes a random value pool to perform optimal parallel processing. The proposed parallel algorithm involves pre-storing the generated random numbers and corresponding encrypted random numbers in the memory space of the random value pool. When an arbitrary integer is needed, the proposed parallel algorithm selects random numbers and their corresponding encrypted random numbers from the random value pool, reducing the cost of encryption operations. The proposed kNN query processing algorithm demonstrates a remarkable 1.6-8.4 times better performance, compared to the parallel versions of existing kNN query processing algorithms.

  Statistics


  Cite this article

[IEEE Style]

Y. Song, H. Kim, J. Chang, "Parallel kNN Query Processing Algorithm Supporting Privacy Preservation," The Transactions of the Korea Information Processing Society, vol. 13, no. 11, pp. 628-636, 2024. DOI: https://doi.org/10.3745/TKIPS.2024.13.11.628.

[ACM Style]

Youngho Song, Hyeong-Jin Kim, and Jae-Woo Chang. 2024. Parallel kNN Query Processing Algorithm Supporting Privacy Preservation. The Transactions of the Korea Information Processing Society, 13, 11, (2024), 628-636. DOI: https://doi.org/10.3745/TKIPS.2024.13.11.628.