From what I understand bloom filters have a hash per item but when i invented (hah) them I used a bit array for each property where each bit describes an item a

From what I understand bloom filters have a hash per item but when i invented (hah) them I used a bit array for each property where each bit describes an item at the same offset. When searching for some properties one can do an AND on those entire arrays and eliminate candidates really fast.