Efficient Processing  of K-Nearest Neighbor Using Data Indexing Technique

Sujata Thete; Prajakta Patil; Nikita Kadam; Deepali Ahire

Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique

March 2017

Vol-3, Issue-2

Paper ID: 4336

ISSN: 2395-4396

Downloads: 0

Abstract & Details

Research Area

Information Technology

Keywords

Spatio-temporal databases spatio-temporal queries K-nearest neighbour queries.

Abstract

Developing an efficient processing techniques in spatio-temporal databases has been nowadays a much discussed topic. Applications, such as mobile information systems, traffic control system, and geographical information systems, can benefit from efficient processing of K-NN queries. Due to the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, it has become convenient for tracking of continuously moving objects. However, this development poses new challenges to database technology since maintaining up-to-date information regarding the location of moving objects incurs an enormous amount of updates. Many applications involving moving objects consists the task of processing k-nearest neighbour (k-NN) queries. Many approaches are designed to this problem, for the centralized setting where query processing is performed on a single server.

License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Author Information

#	Name	Institute / Affiliation
1	Sujata Thete	MET Bhujbal Knowledge City Institute of Engineering,Nasik
2	Prajakta Patil	MET Bhujbal Knowledge City Institute of Engineering,Nasik
3	Nikita Kadam	MET Bhujbal Knowledge City Institute of Engineering,Nasik
4	Deepali Ahire	MET Bhujbal Knowledge City Institute of Engineering,Nasik

How to Cite

Use the following formats to cite this article in your research.

APA Style

Thete, Sujata, Patil, Prajakta, Kadam, Nikita, & Ahire, Deepali (2017). Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique. International Journal of Advance Research and Innovative Ideas In Education, 3(2), 2052-2056.

MLA Style

Thete, Sujata, et al. "Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique." International Journal of Advance Research and Innovative Ideas In Education, vol. 3, no. 2, 2017, pp. 2052-2056.

IEEE Style

Sujata Thete, Prajakta Patil, Nikita Kadam, and Deepali Ahire, "Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique," International Journal of Advance Research and Innovative Ideas In Education, vol. 3, no. 2, pp. 2052-2056, 2017.

Vancouver Style

Thete Sujata, Patil Prajakta, Kadam Nikita, Ahire Deepali. Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique. International Journal of Advance Research and Innovative Ideas In Education. 2017;3(2):2052-2056.

Harvard Style

Thete, Sujata, Patil, Prajakta, Kadam, Nikita, & Ahire, Deepali (2017) 'Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique', International Journal of Advance Research and Innovative Ideas In Education, 3(2), pp. 2052-2056.

Chicago Style

Thete, Sujata, et al. "Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique." International Journal of Advance Research and Innovative Ideas In Education 3, no. 2 (2017): 2052-2056.

Turabian Style

Thete, Sujata, et al. "Efficient Processing of K-Nearest Neighbor Using Data Indexing Technique." International Journal of Advance Research and Innovative Ideas In Education 3, no. 2 (2017): 2052-2056.