Distance browsing in distributed multimedia databases

doi:10.1016/j.future.2008.02.007

2009-01-01

Fabrizio Falchi *

Claudio Gennaro

Pavel Zezula

DOI：10.1016/j.future.2008.02.007

原文链接

查看原文

摘要

En 中文

The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audiovisual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the dataset size, so parallel query execution is needed. In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DIAN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset. The proposed algorithm is being used in two running projects: SAPIR and NeP4B. (c) 2008 Elsevier B. V. All rights reserved.

Keyword:

Distributed

Incremental

Nearest neighbor

Similarity search

Peer-to-peer

MCAN

Content addressable networks

Metric spaces