Publication details
D
-index: Distance Index
| Basic information | |
|---|---|
| Original title: | D-index: Distance Index |
| Authors: | Vlastislav Dohnal, Pavel Zezula |
| Further information | |
|---|---|
| Citation: | DOHNAL, Vlastislav and Pavel ZEZULA. D-index: Distance Index.
2008.Export BibTeX @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} } |
| Original language: | English |
| Field: | Informatics |
| WWW: |  http://lsd.fi.muni.cz/trac/d-index/ |
| Type: | Software |
| Keywords: | D-index; index structure; similarity searching; metric space; similarity query; hashing |
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.
Related projects:
