Cut-region: A Compact Building Block For Hierarchical Metric Indexing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10123410" target="_blank" >RIV/00216208:11320/12:10123410 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-642-32153-5_7" target="_blank" >http://dx.doi.org/10.1007/978-3-642-32153-5_7</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-32153-5_7" target="_blank" >10.1007/978-3-642-32153-5_7</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Cut-region: A Compact Building Block For Hierarchical Metric Indexing

Popis výsledku v původním jazyce

With the emerging applications dealing with complex multimedia retrieval, such as the multimedia exploration, appropriate indexing structures need to be designed. A formalism for compact metric region description can significantly simplify the design ofalgorithms for such indexes, thus more complex and efficient metric indexes can be developed. In this paper, we introduce the cut-regions that are suitable for compact metric region description and we discuss their basic operations. To demonstrate the power of cut-regions, we redefine the PM-Tree using the cut-region formalism and, moreover, we use the formalism to describe our new improvements of the PM-Tree construction techniques. We have experimentally evaluated that the improved construction techniques lead to query performance originally obtained just using expensive construction techniques. Also in comparison with other metric and spatial access methods, the revisited PM-Tree proved its benefits.

Název v anglickém jazyce

Cut-region: A Compact Building Block For Hierarchical Metric Indexing

Popis výsledku anglicky

With the emerging applications dealing with complex multimedia retrieval, such as the multimedia exploration, appropriate indexing structures need to be designed. A formalism for compact metric region description can significantly simplify the design ofalgorithms for such indexes, thus more complex and efficient metric indexes can be developed. In this paper, we introduce the cut-regions that are suitable for compact metric region description and we discuss their basic operations. To demonstrate the power of cut-regions, we redefine the PM-Tree using the cut-region formalism and, moreover, we use the formalism to describe our new improvements of the PM-Tree construction techniques. We have experimentally evaluated that the improved construction techniques lead to query performance originally obtained just using expensive construction techniques. Also in comparison with other metric and spatial access methods, the revisited PM-Tree proved its benefits.

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

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2012

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

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Svazek periodika

2012

Číslo periodika v rámci svazku

7404

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

16

Strana od-do

85-100

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—