SWAM: a family of access methods for similarity-search in peer-to-peer data networks

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

• Type: Conference
• Year: 2004
• Where: CIKM
• Authors: Farnoush Banaei Kashani, Cyrus Shahabi
• Keywords: CIKM 2004, Query Object, Similarity-search Queries, SWAM