Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval
Reexamination Certificate
2007-04-12
2011-10-04
Rones, Charles (Department: 2164)
Data processing: database and file management or data structures
Database and file access
Preparing data for information retrieval
C707S754000
Reexamination Certificate
active
08032529
ABSTRACT:
An interface is operable to receive an element for deletion from a bloom filter. The bloom filter includes multiple hash functions and an array. A processor is operable to generate hash function output values for the element using the hash functions. The hash function output values correspond to indices identifying bits in the array. A memory is operable to maintain supplemental data structure entries. The supplemental data structure has entries associated with the indices. The processor is operable to modify the supplemental data structure entries to delete the element from the bloom filter.
REFERENCES:
patent: 2005/0108368 (2005-05-01), Mohan et al.
patent: 2005/0195832 (2005-09-01), Dharmapurikar et al.
patent: 2005/0257264 (2005-11-01), Stolfo et al.
patent: 2008/0147714 (2008-06-01), Breternitz et al.
Bloom Filter—Wikipedia defintion, downloaded Apr. 12, 2007.
Mitzenmacher et al., “Beyond Bloom Filters: Approximate Concurrent State Machines”, downloaded from http:/
etseminar.stanford.edu/, http:/
etseminar.stanford.edu/sessions/2007-02-22.html, downloaded Apr. 12, 2007.
Basavaiah Murali
Fingerhut John
Gupta Shashank
Cisco Technology Inc.
Khoshnoodi Fariborz
Rones Charles
Weaver Austin Villeneuve and Sampson LLP
LandOfFree
Enhanced bloom filters does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Enhanced bloom filters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enhanced bloom filters will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4270235