Skip Navigation

The Computer Journal 2005 48(1):4-16; doi:10.1093/comjnl/bxh059
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Balakirsky, V. B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?


Capsule reviews

Hashing of Databases with the Use of Metric Properties of the Hamming Space

Vladimir B. Balakirsky *

Institute for Experimental Mathematics (IEM), University of Essen, Ellernstrasse 29, 45326 Essen, Germany

Hashing of databases is considered from the point of view of information and coding theory. The records of a database are represented as binary vectors of the same length stored in the external memory of a computer. The task is formulated as follows: given a pattern and a fixed size of working memory, form the set of addresses of records that can disagree with the pattern in the numberof positions smaller than the given threshold value. We use metric properties of the Hamming space and show that computational efforts needed to search for a pattern in databases can be essentially decreased by using the triangle inequality for the Hamming distances between binary vectors. Furthermore, an introduction of the Lee distance in the space containing the Hamming distances leads to a new metric space where the triangle inequality is effectively used.

Received 20 December 2002. Revised 22 July 2004.

* Email: v.b.balakirsky{at}tue.nl


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.