Space/time trade-offs in hash coding with allowable errors

Abstract

In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash-coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency. The new methods are intended to reduce the amount of space required to contain the hash-coded information from that associated with conventional methods. The reduction in space is accomplished by exploiting the possibility that a small fraction of errors of commission may be tolerable in some applications, in particular, applications in which a large amount of data is involved and a core resident hash area is consequently not feasible using conventional methods. In such applications, it is envisaged that overall performance could be improved by using a smaller core resident hash area in conjunction with the new methods and, when necessary, by using some secondary and perhaps time-consuming test to “catch” the small fraction of errors associated with the new methods. An example is discussed which illustrates possible areas of application for the new methods. Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.

Balancing performance and confidentiality in air index

“…However, key management and cryptography are not the focus of this paper and we try to address the security issue from data management aspect. Another related work in networking is Bloom Filter [2]. Different from the signature technique, it adopts multiple hashing functions to set the bit strings.…”

Tối Ưu Hóa Join Đệ Quy Trên Tập Dữ Liệu Lớn Trong Môi Trường Spark

“…Bộ lọc Bloom (Bloom Filter, BF) [39] được giới thiệu năm 1970 bởi Burton Bloom là một cấu trúc dữ liệu xác suất được sử dụng để kiểm tra xem một phần tử có nằm trong một tập hợp hay không.…”

Non-Parametric Acquisition of Near-Dirac Pixel Correspondences

“…The Bloom filter is an extremely space-efficient data structure for probabilistic set membership testing (Bloom, 1970). It is represented as a vector of m bits, all initialized to 0.…”

“…Bloom filters are extremely space-efficient data structures for probabilistic set membership testing (Bloom, 1970). We show how such structures can be optically constructed in the context of the pixel correspondence problem, and then inverted using heuristics and compressive sensing algorithms.…”