Fast Matching for All Pairs Similarity Search

All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engines, online social networks, and digital libraries frequently have to solve this problem for datasets having millions of records in a high dimensional space, which are often sparse. The challenge is to design algorithms with feasible time requirements. To meet this challenge, algorithms have been proposed based on the inverted index, which maps each dimension to a list of records with non-zero projection along that dimension. Common to these algorithms is a threephase framework of data preprocessing, pairs matching, and indexing. Matching is the most time-consuming phase. Within this framework, we propose fast matching technique that uses the sparse nature of real-world data to effectively reduce the size of the search space through a systematic set of tighter filtering conditions and heuristic optimizations. ...

• Type: Conference
• Year: 2009
• Where: WEBI
• Authors: Amit C. Awekar, Nagiza F. Samatova
• Keywords: Algorithm, Internet Technology, Many Real-world Systems, Pairs Similarity Search, WEBI 2009