On indexing metric spaces using cut-regions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10281470" target="_blank" >RIV/00216208:11320/14:10281470 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.is.2014.01.007" target="_blank" >http://dx.doi.org/10.1016/j.is.2014.01.007</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.is.2014.01.007" target="_blank" >10.1016/j.is.2014.01.007</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On indexing metric spaces using cut-regions

Popis výsledku v původním jazyce

After two decades of research, the techniques for efficient similarity search in metric spaces have combined virtually all the available tricks resulting in many structural index designs. As the representative state-of-the-art metric access methods (alsocalled metric indexes) that vary in the usage of filtering rules and in structural designs, we could mention the M-tree, the M-Index and the List of Clusters, to name a few. In this paper, we present the concept of cut-regions that could heavily improvethe performance of metric indexes that were originally designed to employ simple ball-regions. We show that the shape of cut-regions is far more compact than that of ball-regions, yet preserving simple and concise representation. We present three re-designed metric indexes originating from the above-mentioned ones but utilizing cut-regions instead of ball-regions. We show that cut-regions can be fully utilized in the index structure, positively affecting not only query processing but al

Název v anglickém jazyce

On indexing metric spaces using cut-regions

Popis výsledku anglicky

After two decades of research, the techniques for efficient similarity search in metric spaces have combined virtually all the available tricks resulting in many structural index designs. As the representative state-of-the-art metric access methods (alsocalled metric indexes) that vary in the usage of filtering rules and in structural designs, we could mention the M-tree, the M-Index and the List of Clusters, to name a few. In this paper, we present the concept of cut-regions that could heavily improvethe performance of metric indexes that were originally designed to employ simple ball-regions. We show that the shape of cut-regions is far more compact than that of ball-regions, yet preserving simple and concise representation. We present three re-designed metric indexes originating from the above-mentioned ones but utilizing cut-regions instead of ball-regions. We show that cut-regions can be fully utilized in the index structure, positively affecting not only query processing but al

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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 periodika

Information Systems

ISSN

0306-4379

e-ISSN

—

Svazek periodika

43

Číslo periodika v rámci svazku

July

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

19

Strana od-do

1-19

Kód UT WoS článku

000336110900001

EID výsledku v databázi Scopus

—