(Data) STRUCTURES

We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness! This includes lower bounds for: (a) high-dimensional problems, where the goal is to show large space lower bounds; (b) constant-dimensional geometric problems, where the goal is to bound the query time for space O(n polylg n); (c) dynamic problems, where we are looking for a trade-off between query and update time. (In this case, our bounds are slightly weaker than the originals, losing a lglg n factor.) Our reductions also imply the following new results: (a) an Omega(lg n / lg lg n) bound for 4-dimensional range reporting, given space O(n ldr poly lg n). This is very timely, since a recent result [Nekrich, SoCG'07] solved 3D reporting in near-constant time, raising the prospect that higher dimensions could also be easy; (b) a tight space lower bound for the partial match problem, for constant query time.(c) the first lower bound for reachability oracles.

[1]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[2]  Miklós Ajtai,et al.  A lower bound for finding predecessors in Yao's cell probe model , 1988, Comb..

[3]  Allan Borodin,et al.  Lower bounds for high dimensional nearest neighbor search and related problems , 1999, STOC '99.

[4]  Richard Cole,et al.  Dictionary matching and indexing with errors and don't cares , 2004, STOC '04.

[5]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[6]  Alexandr Andoni,et al.  Hardness of Nearest Neighbor under L-infinity , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  S. Muthukrishnan,et al.  Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract) , 1996, Embedded Systems and Applications.

[8]  Amit Chakrabarti,et al.  An optimal randomised cell probe lower bound for approximate nearest neighbour searching , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Alexandr Andoni,et al.  On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[10]  Thore Husfeldt,et al.  Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching , 1996, SWAT.

[11]  Yakov Nekrich.  A data structure for multi-dimensional range reporting , 2007, SCG '07.

[12]  Monika Henzinger,et al.  Lower Bounds for Fully Dynamic Connectivity Problems in Graphs , 1995, Algorithmica.

[13]  Stephen Alstrup,et al.  Marked ancestor problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[14]  Mikkel Thorup.  Space efficient dynamic stabbing with fast queries , 2003, STOC '03.

[15]  Mihai Patrascu.  Lower bounds for 2-dimensional range counting , 2007, STOC '07.

[16]  Stephen Alstrup,et al.  New data structures for orthogonal range searching , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  Stephen Alstrup,et al.  Worst-case and amortised optimality in union-find (extended abstract) , 1999, STOC '99.

[18]  Bernard Chazelle,et al.  A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube , 1999, STOC '99.

[19]  Ding Liu.  A strong lower bound for approximate nearest neighbor searching , 2004, Inf. Process. Lett..

[20]  Peter Bro Miltersen.  The Bit Probe Complexity Measure Revisited , 1993, STACS.

[21]  Anja Feldmann,et al.  Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).