Lower Bounds for Oblivious Near-Neighbor Search

2019/04/09 by Larsen, Kasper Green, Malkin, Tal, Weinstein, Omri +1
#Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1904.04828

Abstract

We prove an Ω(d \lg n/ (\lg\lg n)²) lower bound on the dynamic cell-probe complexity of statistically oblivious approximate-near-neighbor search (ANN) over the d-dimensional Hamming cube. For the natural setting of d = Θ(log n), our result implies an Ω(\lg² n) lower bound, which is a quadratic improvement over the highest (non-oblivious) cell-probe lower bound for ANN. This is the first super-logarithmic unconditional lower bound for ANN against general (non black-box) data structures. We also show that any oblivious static data structure for decomposable search problems (like ANN) can be obliviously dynamized with O(log n) overhead in update and query time, strengthening a classic result of Bentley and Saxe (Algorithmica, 1980).

Related

• Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities
• Randomized approximate nearest neighbor search with limited adaptivity
• Lower Bounds on Near Neighbor Search via Metric Expansion
• Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors
• Algorithms for Similarity Search and Pseudorandomness