A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints.
Kevin AtighehchiPublished in: J. Parallel Distributed Comput. (2020)
Keyphrases
- complexity analysis
- hash functions
- hash table
- theoretical analysis
- lower bound
- tree structure
- order preserving
- similarity search
- data distribution
- hashing algorithm
- locality sensitive
- neural network
- computational complexity
- first order logic
- locality sensitive hashing
- index structure
- pattern recognition
- training data