This article addresses the issue of dynamicity and durability for scalable indexing of very large and rapidly growing collections of local features for visual instance retrieval. By extending the NV-tree, a scalable disk-based high-dimensional index, we show how to implement the ACID properties of transactions which ensure both dynamicity and durability. We present a detailed performance evaluation of the transactional NV- tree, showing that the insertion throughput is excellent despite the effort to enforce the ACID properties.
|Title of host publication||Proceedings of the International Conference on Similarity Search and Applications (SISAP)|
|Editors||Stéphane Marchand-Maillet, Yasin N. Silva, Edgar Chávez|
|Place of Publication||Lima, Peru|
|Publication date||Oct 2018|
|Publication status||Published - Oct 2018|
|Series||Lecture Notes in Computer Science|