✦ LIBER ✦

Incremental Indexing for High-Dimensional Data using Tree Structure

✍ Scribed by R Vishnu Priya; A. Vadivel

Book ID: 118494433
Publisher: Elsevier
Year: 2012
Weight: 715 KB
Volume: 6
Category: Article
ISSN: 2212-0173
DOI: 10.1016/j.protcy.2012.10.065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tertiary hash tree-based index structure

Tertiary hash tree-based index structure for high dimensional multimedia data

✍ Yoon-Sik Tak, Seungmin Rho, Eenjun Hwang, Hanku Lee 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 393 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

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

Data Structure for Multilayer N-Dimensio

Data Structure for Multilayer N-Dimensional Data Using Hierarchical Structure

✍ Yasuaki Nakamura; Shigeru Abe; Yutaka Ohsawa; Masao Sakauchi 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 773 KB

Tree structures for high dimensionality

Tree structures for high dimensionality nearest neighbor searching

✍ C.M. Eastman; S.F. Weiss 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 887 KB

An n-dimensional region data management

An n-dimensional region data management system using combined tree structures

✍ Yutaka Ohsawa; Masao Sakauchi 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB