Enhancing Similarity Search Throughput by Dynamic Query Reordering

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088102" target="_blank" >RIV/00216224:14330/16:00088102 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-44406-2_14" target="_blank" >http://dx.doi.org/10.1007/978-3-319-44406-2_14</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-44406-2_14" target="_blank" >10.1007/978-3-319-44406-2_14</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Enhancing Similarity Search Throughput by Dynamic Query Reordering

Popis výsledku v původním jazyce

A lot of multimedia data are being created nowadays, which can only be searched by content since no searching metadata are available for them. To make the content search efficient, similarity indexing structures based on the metric-space model can be used. In our work, we focus on a scenario where the similarity search is used in the context of stream processing. In particular, there is a potentially infinite sequence (stream) of query objects, and a query needs to be executed for each of them. The goal is to maximize the throughput of processed queries while maintaining an acceptable delay. We propose an approach based on dynamic reordering of the incoming queries combined with caching of recent results. We were able to achieve up to 3.7 times higher throughput compared to the base case when no reordering and caching is used.

Název v anglickém jazyce

Enhancing Similarity Search Throughput by Dynamic Query Reordering

Popis výsledku anglicky

A lot of multimedia data are being created nowadays, which can only be searched by content since no searching metadata are available for them. To make the content search efficient, similarity indexing structures based on the metric-space model can be used. In our work, we focus on a scenario where the similarity search is used in the context of stream processing. In particular, there is a potentially infinite sequence (stream) of query objects, and a query needs to be executed for each of them. The goal is to maximize the throughput of processed queries while maintaining an acceptable delay. We propose an approach based on dynamic reordering of the incoming queries combined with caching of recent results. We were able to achieve up to 3.7 times higher throughput compared to the base case when no reordering and caching is used.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

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)

Rok uplatnění

2016

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

Database and Expert Systems Applications: 27th International Conference, DEXA 2016, Porto, Portugal, September 5-8, 2016, Proceedings, Part II

ISBN

9783319444055

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

16

Strana od-do

185-200

Název nakladatele

Springer International Publishing

Místo vydání

Cham

Místo konání akce

Porto, Portugal

Datum konání akce

5. 9. 2016

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

WRD - Celosvětová akce

Kód UT WoS článku

—