Modifying Hamming Spaces for Efficient Search

Investor logo


This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on

MÍČ Vladimír NOVÁK David ZEZULA Pavel

Year of publication 2018
Type Article in Proceedings
Conference 18th International Conference on Data Mining Workshops (ICDMW), Singapore, November 17-21, 2018
MU Faculty or unit

Faculty of Informatics

Keywords Similarity search;Hamming space;Hamming Weight Tree; Lower bound inthe Hamming space
Attached files
Description We focus on the efficient search for the most similar bit strings to a given query in the Hamming space. The distance of this space can be lower-bounded by a function based on a difference of the number of ones in the compared strings, i.e. their weights. Recently, such property has been successfully used by the Hamming Weight Tree (HWT) indexing structure. We propose modifications of the bit strings that preserve pairwise Hamming distances but improve the tightness of these lower bounds, so the query evaluation with the HWT is several times faster. We also show that the unbalanced bit strings, recently reported to provide similar quality of search as the traditionally used balanced bit strings, are more easy to index with the HWT. Combined with the distance preserving modifications, the HWT query evaluation can be more than one order of magnitude faster than the HWT baseline. Finally, we show that such modifications are useful even for a very complex data where the search with the HWT is slower than a sequential search.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info