A Fixed-Size Bloom Filter for Searching Textual Documents
نویسندگان
چکیده
منابع مشابه
A Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملA Robust Bloom Filter
A Bloom filter is a space-efficient randomized data structure representing a set for membership queries. Faults in Bloom filters, however, cannot guarantee no false negatives. In this paper, we present a simple redundancy scheme for detecting false negatives and tolerating false positives induced by faults in Bloom filters during normal operation. A spare hashing unit with a simple coding techn...
متن کاملConstrained Coclustering for Textual Documents
In this paper, we present a constrained co-clustering approach for clustering textual documents. Our approach combines the benefits of information-theoretic co-clustering and constrained clustering. We use a two-sided hidden Markov random field (HMRF) to model both the document and word constraints. We also develop an alternating expectation maximization (EM) algorithm to optimize the constrain...
متن کاملBuilding a Better Bloom Filter
A technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifically, only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptotic false ...
متن کاملThe Gaussian Bloom Filter
Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a small, constant-size data structure. In or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1989
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/32.3.212