bloomRF: On Performing Range-Queries in Bloom-Filters with Piecewise-Monotone Hash Functions and Prefix Hashing.
Bernhard MößnerChristian RieggerArthur BernhardtIlia PetrovPublished in: CoRR (2022)
Keyphrases
- range queries
- hash functions
- bloom filter
- index structure
- data structure
- data distribution
- locality sensitive hashing
- multi dimensional
- locality sensitive
- hashing algorithm
- similarity search
- r tree
- query processing
- tree structure
- hashing methods
- order preserving
- main memory
- nearest neighbor search
- cost model
- metric space
- space efficient
- range query processing
- hamming distance
- linear hashing
- record linkage
- hash table
- knn
- nearest neighbor
- similarity queries
- external memory
- access methods
- secret key
- indexing techniques
- b tree
- binary codes
- data cube
- membership queries
- hamming space
- indexing structure
- data mining
- privacy preserving
- high dimensional