matching depends on which match step you mean.
*Bloom Filter Match* create a bloom filter for your target ( call it T). Compare with each Bloomfilter in the table (call these B). A match is this case is an "AND" operation on the 2 bitmaps if T & B == T then it is a match. *Verification Match (Step 3 above)* For the records returned by the bloom filter match there may be false positives (this is the nature of the bloom filter). So you look at each record (not bloom filter) and verify that the requested fields (G and S in the example above) from the returned records actually match the values for G and S that you are looking for. *Side Observation* Paul mentioned building indexes on the fly in Salesforce. It may be possible to do something similar. If you can create a subset of the data that contains the solutions you are looking for and then index that it may be faster than using a very large index. But finding the subset is not trivial and may be too expensive in and of itself. Claude On Mon, Aug 31, 2015 at 4:35 PM, [email protected] <[email protected]> wrote: > I apologize if I am being thick here, but I don't understand how one goes > about checking the potential match without some kind of covering resource > against which to do that, something with a full representation of the > graph. Can you elaborate on how to check the validity of the match? > > Thank you for taking the time to walk through this! > > --- > A. Soroka > The University of Virginia Library > > On Aug 31, 2015, at 10:04 AM, Claude Warren <[email protected]> wrote: > > > Step 3 is about removing the false positives from the bloom filter. It > does not require an index, it requires checking the values to ensure match. > > -- I like: Like Like - The likeliest place on the web <http://like-like.xenei.com> LinkedIn: http://www.linkedin.com/in/claudewarren
