bloomRF: On Performing Range-Queries with Bloom-Filters based on Piecewise-Monotone Hash Functions and Dyadic Trace-Trees.
Christian RieggerArthur BernhardtBernhard MoessnerIlia PetrovPublished in: CoRR (2020)
Keyphrases
- range queries
- bloom filter
- hash functions
- index structure
- data distribution
- multi dimensional
- tree structure
- data structure
- query processing
- locality sensitive hashing
- similarity search
- r tree
- space efficient
- order preserving
- cost model
- metric space
- nearest neighbor
- knn
- record linkage
- access methods
- indexing techniques
- main memory
- hash table
- decision trees
- range query processing
- nearest neighbor search
- hamming distance
- secret key
- database systems
- indexing structure
- membership queries
- b tree
- similarity queries
- binary codes
- boolean functions
- database management systems
- uniform distribution
- data management
- hashing methods
- high dimensional