Database Optimization Via Effective K-nearest Neighbors Search

Student: Skoropostizhnyy Egor

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2017

Database Optimization Via Effective K-nearest Neighbors Search Theme of the work is to study the possibility of DB optimization with the help of effective search for k-nearest neighbors. The aim of this paper is to investigate the possibility of replacing standard indexes in databases with indices based on finding the nearest neighbor And test its work on real data. As a result, such an index was developed and tested on the basis of real airport DB.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses