Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters

Abstract

We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t ≤ wc sets involved in the query, w is the number of bits in a memory word, k is the output size, and c ≥ 1 is any fixed constant.