Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00095026" target="_blank" >RIV/00216224:14330/17:00095026 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-68474-1_2" target="_blank" >http://dx.doi.org/10.1007/978-3-319-68474-1_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-68474-1_2" target="_blank" >10.1007/978-3-319-68474-1_2</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA16-18889S" target="_blank" >GA16-18889S: Analytika pro velká nestrukturovaná data</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Similarity Search and Applications : 10th International Conference, SISAP 2017, Munich, Germany, October 4-6, 2017, Proceedings

ISBN

9783319684734

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

17

Strana od-do

17-33

Název nakladatele

Springer, Cham

Místo vydání

Cham

Místo konání akce

Munich, Germany

Datum konání akce

4. 10. 2017

Typ akce podle státní příslušnosti

CST - Celostátní akce

Kód UT WoS článku

—