Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is kNN Queries

Chapter 11
Emerging Technologies and Applications in Data Processing and Management
Given two dataset R and S in space D , and an integer k . k NN queries of R and S (denoted as k nnQ), combine each point r ? R with its k nearest neighbors from S : k nnQ( R , S ) = {( r , k NN( r , S )) | for all r ? R }.
Published in Chapter:
Voronoi-Based kNN Queries Using K-Means Clustering in MapReduce
Wei Yan (Liaoning University, China)
Copyright: © 2019 |Pages: 22
DOI: 10.4018/978-1-5225-8446-9.ch011
Abstract
The kNN queries are special type of queries for massive spatial big data. The k-nearest neighbor queries (kNN queries), designed to find k nearest neighbors from a dataset S for every point in another dataset R, are useful tools widely adopted by many applications including knowledge discovery, data mining, and spatial databases. In cloud computing environments, MapReduce programming model is a well-accepted framework for data-intensive application over clusters of computers. This chapter proposes a method of kNN queries based on Voronoi diagram-based partitioning using k-means clusters in MapReduce programming model. Firstly, this chapter proposes a Voronoi diagram-based partitioning approach for massive spatial big data. Then, this chapter presents a k-means clustering approach for the object points based on Voronoi diagram. Furthermore, this chapter proposes a parallel algorithm for processing massive spatial big data using kNN queries based on k-means clusters in MapReduce programming model. Finally, extensive experiments demonstrate the efficiency of the proposed approach.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 14
Parallel kNN Queries for Big Data Based on Voronoi Diagram Using MapReduce
Given two dataset R and S in space D , and an integer k . k NN queries of R and S (denoted as k nnQ), combine each point r ? R with its k nearest neighbors from S . k nnQ( R , S ) = {( r , k NN( r , S )) | for all r ? R }.
Published in Chapter: Parallel kNN Queries for Big Data Based on Voronoi Diagram Using MapReduce; From: Handbook of Research on Innovative Database Query Processing Techniques
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR