✦ LIBER ✦

CVA file: an index structure for high-dimensional datasets

✍ Scribed by Jiyuan An; Hanxiong Chen; Kazutaka Furuse; Nobuo Ohbo

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 527 KB
Volume: 7
Category: Article
ISSN: 0219-1377
DOI: 10.1007/s10115-004-0149-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Persistent clustered main memory index f

Persistent clustered main memory index for acceleratingk-NN queries on high dimensional datasets

✍ Alexander Thomasian; Lijuan Zhang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 494 KB

MKL-tree: an index structure for high-di

MKL-tree: an index structure for high-dimensional vector spaces

✍ Annalisa Franco; Alessandra Lumini; Dario Maio 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 611 KB

An adaptive and dynamic dimensionality r

An adaptive and dynamic dimensionality reduction method for high-dimensional indexing

✍ Heng Tao Shen; Xiaofang Zhou; Aoying Zhou 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 613 KB

SR-tree: An index structure for nearest-

SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data

✍ Norio Katayama; Shin'ichi Satoh 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in

SPY-TEC: An efficient indexing method fo

SPY-TEC: An efficient indexing method for similarity search in high-dimensional data spaces

✍ Dong-Ho Lee; Hyoung-Joo Kim 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 650 KB