Snake table: a dynamic pivot table for streams of k-NN searches

Authors:
Juan Manuel Barrios;Benjamin Bustos;Tomáš Skopal
Affiliations:
KDW+PRISMA, Department of Computer Science, University of Chile, Chile;KDW+PRISMA, Department of Computer Science, University of Chile, Chile;SIRET Research Group, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic
Venue:
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Year:
2012

Citing 9
Cited 0

New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)

Pattern Recognition Letters
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements

Pattern Recognition Letters
Searching in metric spaces

ACM Computing Surveys (CSUR)
Similarity Search: The Metric Space Approach (Advances in Database Systems)

Similarity Search: The Metric Space Approach (Advances in Database Systems)
A Dynamic Pivot Selection Technique for Similarity Search

SISAP '08 Proceedings of the First International Workshop on Similarity Search and Applications (sisap 2008)
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index

ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
D-Cache: Universal Distance Cache for Metric Access Methods

IEEE Transactions on Knowledge and Data Engineering
Color and texture descriptors

IEEE Transactions on Circuits and Systems for Video Technology
Spatiotemporal sequence matching for efficient video copy detection

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the Snake Table, an index structure designed for supporting streams of k-NN searches within a content-based similarity search framework. The index is created and updated in the online phase while resolving the queries, thus it does not need a preprocessing step. This index is intended to be used when the stream of query objects fits a snake distribution, that is, when the distance between two consecutive query objects is small. In particular, this kind of distribution is present in content-based video retrieval systems, when the set of query objects are consecutive frames from a query video. We show that the Snake Table improves the efficiency of k-NN searches in these systems, avoiding the building of a static index in the offline phase.