Paper Info
Title
LVA-Index: An Efficient Way to Determine Nearest Neighbors.
Abstract
In this paper we present our new LVA-Index for indexing multidimensional data. The LVA-Index has a layered structure improving performance when searching for nearest neighbors. The index combines some features of the VA-File and the NBC algorithm, namely: the idea of approximation of the data vectors and the idea of layers. The crucial advantage of the LVA-Index is that it stores n neighbor layers for each cell. For this reason, contrary to the VA-File, the LVA-Index does not require scanning of the entire approximation file. Our experiments proved that searching using the LVA-Index is faster than searching using the VA-File which was designed to effectively handle multidimensional data.
Year
DOI
Venue
2009
10.1007/978-3-642-00563-3_65
MAN-MACHINE INTERACTIONS
Keywords
Field
DocType
indexing,index structure,VA-File,nearest neighbor search
Computer science,Search engine indexing,Algorithm,Nearest neighbor search
Conference
Volume
ISSN
Citations 
59
1867-5662
0
PageRank 
References 
Authors
0.34
5
1
Name
Order
Citations
PageRank
Piotr Lasek1644.15