Dynamic behavior of balanced NV-trees

Arnar Olafsson 1 Björn Þór Jónsson 1, * Laurent Amsaleg 2 Herwig Lejsek 1
* Auteur correspondant
2 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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. Here, we focus on the dynamic behavior of the balanced NV-tree, which is a disk-based approximate index for very large collections. We report on an initial study of the effects of several implementation choices for the balanced NV-tree, and show that with appropriate implementation, significant performance improvements are possible. Overall, the proposed techniques not only reduce maintenance cost, but can also improve search performance significantly with minimal loss of search quality.
Type de document :
Article dans une revue
Liste complète des métadonnées

Contributeur : Patrick Gros <>
Soumis le : jeudi 2 septembre 2010 - 15:21:43
Dernière modification le : mercredi 16 mai 2018 - 11:23:05

Lien texte intégral



Arnar Olafsson, Björn Þór Jónsson, Laurent Amsaleg, Herwig Lejsek. Dynamic behavior of balanced NV-trees. Multimedia Systems, Springer Verlag, 2010, 〈http://www.springerlink.com/content/e303136755270314/fulltext.html〉. 〈10.1007/s00530-010-0199-4〉. 〈inria-00514479〉



Consultations de la notice