Dynamic bloom filter for caching query results

Details Dynamic bloom filter for caching query results Dynamic bloom filter for caching query results

2006-06-26

2009-06-16

Lee, Wilson (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

07548908

ABSTRACT:
Methods, systems, and machine-readable media are disclosed for searching a corpus of information by utilizing a Bloom filter for caching query results. According to one aspect of the present invention, a method of caching information from a corpus of information can include populating one or more Bloom filters with a plurality of bits representative of information in the corpus of information. A search request can be received identifying requested information from the corpus of information. One or more bits in the filter(s) associated with the requested information can be checked and the requested information can be retrieved from the corpus of information based on results of said checking. Furthermore, the filter(s) can be used to determine which information to make available to a particular user in a system where certain information is associated with or access is limited to certain users or groups of users.

REFERENCES:
patent: 6920477 (2005-07-01), Mitzenmacher
patent: 7369557 (2008-05-01), Sinha
patent: 2005/0120004 (2005-06-01), Stata et al.
Mark Fischer, Coding Bloom Filter, Sep. 11, 2000.

Affiliated with

Also associated with

Rating

Dynamic bloom filter for caching query results does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic bloom filter for caching query results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic bloom filter for caching query results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4061479