An indexing structure for dynamic multidimensional data in vector space.

E. Mikhaylova, B. Novikov, A. Volokhov

Результат исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучная

Аннотация

The multidimensional k – NN (k nearest neighbors) query problem is relevant to a large variety of database applications, including information retrieval, natural language processing, and data mining. To solve it efficiently, the database needs an indexing structure that provides this kind of search. However, attempts to find an exact solution are hardly feasible in multidimensional space. In this paper, a novel indexing technique for the approximate solution of k – NN problem is described and analyzed. The construction of the indexing tree is based on clustering. Indexing structure is implemented on top of high-performance industrial DBMS.
Язык оригиналаанглийский
Название основной публикацииAn indexing structure for dynamic multidimensional data in vector space.
Страницы185-193
DOI
СостояниеОпубликовано - 2013

Fingerprint

Подробные сведения о темах исследования «An indexing structure for dynamic multidimensional data in vector space.». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать