Binary Sketches for Secondary Filtering

MÍČ, Vladimír, David NOVÁK and Pavel ZEZULA. Binary Sketches for Secondary Filtering. ACM Transactions on Information Systems. New York: ACM Press, 2019, vol. 37, No 1, p. "1:1"-"1:28", 28 pp. ISSN 1046-8188. Available from: https://dx.doi.org/10.1145/3231936.

Basic information

• Original name: Binary Sketches for Secondary Filtering
• Authors: MÍČ, Vladimír (203 Czech Republic, belonging to the institution), David NOVÁK (203 Czech Republic, belonging to the institution) and Pavel ZEZULA (203 Czech Republic, guarantor, belonging to the institution).
• Edition: ACM Transactions on Information Systems, New York, ACM Press, 2019, 1046-8188.

Other information

• Original language: English
• Type of outcome: Article in a journal
• Field of Study: 10200 1.2 Computer and information sciences
• Country of publisher: United States of America
• Confidentiality degree: is not subject to a state or trade secret
• WWW: URL
• Impact factor: Impact factor: 2.889
• RIV identification code: RIV/00216224:14330/19:00107167
• Organization unit: Faculty of Informatics
• Doi: http://dx.doi.org/10.1145/3231936
• UT WoS: 000457519000001
• Keywords in English: Top-k retrieval in databases;Retrieval efficiency;Retrieval effectiveness;Similarity measures
• Tags: best, DISA

Abstract

This paper addresses the problem of matching the most similar data objects to a given query object. We adopt a generic model of similarity that involves the domain of objects and metric distance functions only. We examine the case of a large dataset in a complex data space which makes this problem inherently difficult. Many indexing and searching approaches have been proposed but they have often failed to efficiently prune complex search spaces and access large portions of the dataset when evaluating queries. We propose an approach to enhancing the existing search techniques so as to significantly reduce the number of accessed data objects while preserving the quality of the search results. In particular, we extend each data object with its sketch, a short binary string in Hamming space. These sketches approximate the similarity relationships in the original search space, and we use them to filter out non-relevant objects not pruned by the original search technique. We provide a probabilistic model to tune the parameters of the sketch-based filtering separately for each query object. Experiments conducted with different similarity search techniques and real-life datasets demonstrate that the secondary filtering can speed-up similarity search several times.

Links

• GBP103/12/G084, research and development project: Name: Centrum pro multi-modální interpretaci dat velkého rozsahu

Investor: Czech Science Foundation