SWAM

• DOI: 10.1145/1031171.1031236
• Publication Date: 2005-01-30T12:58:48Z
• Authors: Farnoush Banaei-K...; Cyrus Shahabi
• Keywords: Similarity (geometry); Range query (database); File Sharing

Peer-to-peer Data Networks (PDNs) are large-scale, self-organizing, distributed query processing systems. Familiar examples of PDN peer-to-peer file-sharing networks, which support exact-match search queries to locate user-requested files. In this paper, we formalize the more general problem <i>similarity-search</i> in PDNs, and propose a <i>family</i> access methods, termed <i>Small-World Access Methods (SWAM)</i>, for efficient execution various similarity-search queries, namely exact-match, range, k-nearest-neighbor queries. Unlike its predecessors, i.e., LH* DHTs, SWAM does not control assignment data objects nodes; each node autonomously stores own data. Besides, supports all on multiple attributes. guarantees that object will be found (if it exists network) average time logarithmically proportional network size. Moreover, once is found, similar would proximate neighborhood hence enabling range