| NÁLEPA, Filip, Michal BATKO and Pavel ZEZULA. Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries. In Christian Beecks, Felix Borutta, Peer Kröger, Thomas Seidl. Similarity Search and Applications : 10th International Conference, SISAP 2017, Munich, Germany, October 4-6, 2017, Proceedings. Cham: Springer, Cham, 2017, p. 17-33. ISBN 978-3-319-68473-4. Available from: https://dx.doi.org/10.1007/978-3-319-68474-1_2. |
Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1391457,
author = {Nálepa, Filip and Batko, Michal and Zezula, Pavel},
address = {Cham},
booktitle = {Similarity Search and Applications : 10th International Conference, SISAP 2017, Munich, Germany, October 4-6, 2017, Proceedings},
doi = {http://dx.doi.org/10.1007/978-3-319-68474-1_2},
editor = {Christian Beecks, Felix Borutta, Peer Kröger, Thomas Seidl},
keywords = {approximate similarity search; stream of kNN queries},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Cham},
isbn = {978-3-319-68473-4},
pages = {17-33},
publisher = {Springer, Cham},
title = {Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries},
year = {2017}
}
TY - JOUR
ID - 1391457
AU - Nálepa, Filip - Batko, Michal - Zezula, Pavel
PY - 2017
TI - Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries
PB - Springer, Cham
CY - Cham
SN - 9783319684734
KW - approximate similarity search
KW - stream of kNN queries
N2 - Content-based similarity search techniques have been employed in a variety of today applications. In our work, we aim at the scenario when the similarity search is applied in the context of stream processing. In particular, there is a stream of query objects which need to be evaluated. Our goal is to be able to cope with the rate of incoming query objects (i.e., to reach sufficient throughput) and, at the same time, to preserve the quality of the obtained results at high levels. We propose an approximation technique for the similarity search which combines the probability of an indexed object to be a part of a query result and the time needed to examine the object. We are able to achieve better trade-off between the efficiency (processing time) and the quality (precision) of the similarity search compared to traditional priority queue based approximation techniques.
ER -
NÁLEPA, Filip, Michal BATKO and Pavel ZEZULA. Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries. In Christian Beecks, Felix Borutta, Peer Kröger, Thomas Seidl. \textit{Similarity Search and Applications : 10th International Conference, SISAP 2017, Munich, Germany, October 4-6, 2017, Proceedings}. Cham: Springer, Cham, 2017, p.~17-33. ISBN~978-3-319-68473-4. Available from: https://dx.doi.org/10.1007/978-3-319-68474-1\_{}2.
|
