Other formats:
BibTeX
LaTeX
RIS
@misc{836627,
author = {Dohnal, Vlastislav and Zezula, Pavel},
keywords = {D-index; index structure; similarity searching; metric space; similarity query; hashing},
language = {eng},
institution = {Masarykova univerzita},
organization = {Masarykova univerzita},
title = {D-index: Distance Index},
url = {http://lsd.fi.muni.cz/trac/d-index/},
year = {2008}
}
TY -
ID - 836627
AU - Dohnal, Vlastislav - Zezula, Pavel
PY - 2008
TI - D-index: Distance Index
KW - D-index
KW - index structure
KW - similarity searching
KW - metric space
KW - similarity query
KW - hashing
UR - http://lsd.fi.muni.cz/trac/d-index/
N2 - D-index is an index structure which is able to search in data modelled as a metric space. This structure is static with respect to the number of buckets and levels, so the split functions must be designed before the D-index is instantiated and loaded with data. When this prerequisite is fulfiled, the D-index is capable of storing nearly "unlimited" number of data objects due to the elasticity of individual buckets. In particular, buckets are capable of storing theoretically any amount of data.
ER -
DOHNAL, Vlastislav and Pavel ZEZULA. \textit{D-index: Distance Index}. 2008.
|
