D-Index: Distance Searching Index for Metric Data Sets

J 2003

D-Index: Distance Searching Index for Metric Data Sets

DOHNAL, Vlastislav, Claudio GENNARO, Pasquale SAVINO and Pavel ZEZULA

Basic information

Original name

D-Index: Distance Searching Index for Metric Data Sets

Name in Czech

D-Index: Vyhledávací index podle vzdálenosti pro metrické prostory

Authors

DOHNAL, Vlastislav (203 Czech Republic), Claudio GENNARO (380 Italy), Pasquale SAVINO (380 Italy) and Pavel ZEZULA (203 Czech Republic, guarantor)

Edition

Multimedia Tools and Applications, Kluwer Academic Publishers, 2003, 1380-7501

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

20206 Computer hardware and architecture

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

URL

Impact factor

Impact factor: 0.438

RIV identification code

RIV/00216224:14330/03:00008839

Organization unit

Faculty of Informatics

UT WoS

000184619000002

Keywords in English

metric spaces; similarity search; index structures; performance evaluation

Abstract

ORIG CZ

V originále

In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. We propose a new index structure, called D-Index, that combines a novel clustering technique and the pivot-based distance searching strategy to speed up execution of similarity range and nearest neighbor queries for large files with objects stored in disk memories. We have qualitatively analyzed D-Index and verified its properties on actual implementation. We have also compared D-Index with other index structures and demonstrated its superiority on several real-life data sets. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete/insert operations.

In Czech

Navrhujeme novou indexovací strukturu D-Index, která kombinuje novou shlukovací techniku a pivotovací filtrování s cílem urychlit provádění podobnostních dotazů. Vlastnosti D-Indexu jsou experimentálně ověřeny a struktura je porovnávána s jinými řešeními pro metrické prostory.

Links

MSM 143300004, plan (intention)

Name: Digitální knihovny

Investor: Ministry of Education, Youth and Sports of the CR, Digital libraries

Citovat

DOHNAL, Vlastislav, Claudio GENNARO, Pasquale SAVINO and Pavel ZEZULA. D-Index: Distance Searching Index for Metric Data Sets. Multimedia Tools and Applications. Kluwer Academic Publishers, 2003, vol. 21, No 1, p. 9-33, 24 pp. ISSN 1380-7501.

@article{488136,
   author = {Dohnal, Vlastislav and Gennaro, Claudio and Savino, Pasquale and Zezula, Pavel},
   article_number = {1},
   keywords = {metric spaces; similarity search; index structures; performance evaluation},
   language = {eng},
   issn = {1380-7501},
   journal = {Multimedia Tools and Applications},
   title = {D-Index: Distance Searching Index for Metric Data Sets},
   url = {http://ipsapp008.kluweronline.com/content/getfile/5025/47/2/abstract.htm},
   volume = {21},
   year = {2003}
}

TY  - JOUR
ID  - 488136
AU  - Dohnal, Vlastislav - Gennaro, Claudio - Savino, Pasquale - Zezula, Pavel
PY  - 2003
TI  - D-Index: Distance Searching Index for Metric Data Sets
JF  - Multimedia Tools and Applications
VL  - 21
IS  - 1
SP  - 9-33
EP  - 9-33
PB  - Kluwer Academic Publishers
SN  - 13807501
KW  - metric spaces
KW  - similarity search
KW  - index structures
KW  - performance evaluation
UR  - http://ipsapp008.kluweronline.com/content/getfile/5025/47/2/abstract.htm
N2  - In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. We propose a new index structure, called D-Index, that combines a novel clustering technique and the pivot-based distance searching strategy to speed up execution of similarity range and nearest neighbor queries for large files with objects stored in disk memories. We have qualitatively analyzed D-Index and verified its properties on actual implementation. We have also compared D-Index with other index structures and demonstrated its superiority on several real-life data sets. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete/insert operations.
ER  -

DOHNAL, Vlastislav, Claudio GENNARO, Pasquale SAVINO and Pavel ZEZULA. D-Index: Distance Searching Index for Metric Data Sets. \textit{Multimedia Tools and Applications}. Kluwer Academic Publishers, 2003, vol.~21, No~1, p.~9-33, 24 pp. ISSN~1380-7501.

Detailed Information on Publication Record