Hashing of databases based on indirect observations of Hamming distances

DOI10.1109/18.485741zbMATH Open0852.68022OpenAlexW2106912783MaRDI QIDQ4885705FDOQ4885705

V. B. Balakirskij

Publication date: 26 November 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a1f8dbf0f98689599020b4ae8b8e4e9714ea346c

Recommendations

• Space/time trade-offs in hash coding with allowable errors
• scientific article; zbMATH DE number 2162205
• Locality-sensitive hashing without false negatives
• scientific article; zbMATH DE number 1003256
• Neighborhood preserving hashing and approximate queries

zbMATH Keywords

codinghashing of databases

Mathematics Subject Classification ID

Database theory (68P15) Decoding (94B35)

Cited In (1)

• Robust property-preserving hash functions for Hamming distance and more

This page was built for publication: Hashing of databases based on indirect observations of Hamming distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885705)