bloomfilter | The implementation of bloomfilter with bit set of java

pub type BitsIter = Box>;

In this case, the object in the box must be valid for the 'static lifetime. This isn't the case for the iterator returned by hash - its limited to the lifetime of self.

Try replacing with:

You can explode your array sequence in your IpMonitor objects using explode function, then use a left outer join to match ips present in your Ips dataset, then filter out on ipType == "home" or ip is present in Ips dataset and finally rebuild your IpLocation sequence by grouping by id and collect_list.

Complete code is as follows:

1. Is putAll() the correct way to get the union of two bloom filters?

Yes, BloomFilter#putAll(BloomFilter) JavaDoc says:

Combines this Bloom filter with another Bloom filter by performing a bitwise OR of the underlying data. The mutations happen to this instance. Callers must ensure the Bloom filters are appropriately sized to avoid saturating them.

The catch is that it'll throw IllegalArgumentException - if isCompatible(that) == false, so if you want to use this method you must make sure that isCompatible returns true:

Determines whether a given Bloom filter is compatible with this Bloom filter. For two Bloom filters to be compatible, they must:

• not be the same instance
• have the same number of hash functions
• have the same bit size
• have the same strategy
• have equal funnels

That said, let's try to answer the second question and find an easier solution.

1. Is there a non-reflective way to get the intersection of two or more bloom filters?

Yes, you can use the fact that BloomFilters implement Predicate and use its .and() and .or() methods, remembering that mightContain behavior depends on BloomFilter's parameters.

Example:

I stored them as BLOB objects.

Converting bytes to a String and back is not always reversible in any Charset. You must use a tool such as Base64 (provided in Guava as BaseEncoding.base64()) to convert a byte array to a string in such a way that you can always convert it back correctly.

To guarantee to apply the index to all data need to re-insert them all. I would recommend creating the test table with the required index and partially fill it. To use it as a playground to find more optimal indexes.

Consider to use hasToken-function or others ones allowed to tokenbf_v1-index (see Skipping index: functions support):

I think it is sigar-lib that cassandra uses that is causing the problem (especially on the recent JDK8).

It is not necessary to run cassandra, so you can comment out this line from cassandra-env.ps1 in conf directory: https://github.com/apache/cassandra/blob/cassandra-3.11.7/conf/cassandra-env.ps1#L357