iDistance : An adaptive B+-tree based indexing method for nearest neighbor search

In this article, we present an efficient B + -tree based indexing method, called iDistance, for K-nearest neighbor (KNN) search in a high-dimensional metric space. iDistance partitions the data based on a space- or data-partitioning strategy, and selects a reference point for each partition. The dat...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on database systems 2005-06, Vol.30 (2), p.364-397
Hauptverfasser:	JAGADISH, H. V, BENG CHIN OOI, TAN, Kian-Lee, CUI YU, RUI ZHANG
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Efficiency Exact sciences and technology Experiments Indexing Information systems. Data bases Memory organisation. Data processing Optimization Searches Software
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!