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