A Bloom Filter for High Dimensional Vectors
Regardless of the type of data, traditional Bloom filters treat each element of a set as a string, and by iterating every character of the string, they discretize all data randomly and uniformly. However, with the data size and dimension increases, these variants are inefficient. To better discretiz...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-07-01
|
| Series: | Information |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2078-2489/9/7/159 |