Optimizing Query Performance with Inverted Cache in Metric Spaces

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors

ANTOL Matej DOHNAL Vlastislav

Type Article in Proceedings
Conference Advances in Databases and Information Systems, 20th East European Conference, ADBIS 2016
MU Faculty or unit

Faculty of Informatics

Citation
WWW http://link.springer.com/chapter/10.1007/978-3-319-44039-2_5
Doi http://dx.doi.org/10.1007/978-3-319-44039-2_5
Field Informatics
Keywords similarity search;nearest-neighbors query;metric space;inverted cache;query optimization
Description Similarity searching has become widely available in many on-line archives of multimedia content. Querying such systems starts with either a query object provided by user or a random object provided by the system, and proceeds in more iterations to improve user's satisfaction with query results. This leads to processing many very similar queries by the system. In this paper, we analyze performance of two representatives of metric indexing structures and propose a novel concept of reordering search queue that optimizes access to data partitions for repetitive queries. This concept is verified in numerous experiments on real-life image dataset.
Related projects: