کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
515153 866961 2007 19 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Nearest neighbor search in metric spaces through Content-Addressable Networks
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
Nearest neighbor search in metric spaces through Content-Addressable Networks
چکیده انگلیسی

Most of the peer-to-peer search techniques proposed in the recent years have focused on the single-key retrieval. However, similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. In this paper we introduce an extension of the well-known Content-Addressable Network paradigm to support storage and retrieval of more generic metric space objects. In particular we address the problem of executing the nearest neighbors queries, and propose three different algorithms of query propagation. An extensive experimental study on real-life data sets explores the performance characteristics of the proposed algorithms by showing their advantages and disadvantages.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing & Management - Volume 43, Issue 3, May 2007, Pages 665–683
نویسندگان
, , ,