Dynamic Behavior of Balanced NV-trees

In recent years, some approximate high-dimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While the query performance and quality of these methods has been well studied, however, the performance of index maintenance has not yet been reported in any detail. In this thesis we focus on the dynamic behavior of the NV-tree, which is a disk-based approximate index for very large collections. The NV-tree has several configuration and implementation options that affect the performance of index maintenance. We report on an initial study of the effects of these options on the dynamic behavior of the balanced NV-tree, and show that with appropriate implementation, significant performance improvements are possible. We implemented flexible configuration into the balanced NV-tree and ran detailed query search experiments on live data. We show that our configurations not only reduce maintenance cost, but can also improve search performance significantly with minimal loss of search quality

Author dc:creator

• Arnar Ólafsson 1973-

Contributors dc:contributor

• Háskólinn í Reykjavík

• Gagnavinnsla
• Tölvunarfræði
• Meistaraprófsritgerðir
• Computer science

Language dc:language.iso

en

Handle dc:identifier.uri

http://hdl.handle.net/1946/7434

OAI identifier oai:identifier

oai:skemman.is:1946/7434