Abstract
In the orthogonal range reporting problem, we are to preprocess a set of n points with integer coordinates on a U × U grid. The goal is to support reporting all k points inside an axis-aligned query rectangle. This is one of the most fundamental data structure problems in databases and computational geometry. Despite the importance of the problem its complexity remains unresolved in the word-RAM. On the upper bound side, three best tradeoffs exist, all derived by reducing range reporting to a ball-inheritance problem. Ball-inheritance is a problem that essentially encapsulates all previous attempts at solving range reporting in the word-RAM. In this paper we make progress towards closing the gap between the upper and lower bounds for range reporting by proving cell probe lower bounds for ball-inheritance. Our lower bounds are tight for a large range of parameters, excluding any further progress for range reporting using the ball-inheritance reduction.
Original language | English |
---|---|
Book series | Leibniz International Proceedings in Informatics |
Volume | 55 |
Pages (from-to) | 92:1 - 92:12 |
Number of pages | 12 |
ISSN | 1868-8969 |
DOIs | |
Publication status | Published - 1 Aug 2016 |
Event | ICALP 2016 : 43RD INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING - Rome, Italy Duration: 12 Jul 2016 → 15 Jul 2016 http://www.easyconferences.eu/icalp2016/index.html |
Conference
Conference | ICALP 2016 |
---|---|
Country/Territory | Italy |
City | Rome |
Period | 12/07/2016 → 15/07/2016 |
Internet address |
Keywords
- Cell probe model
- Data structures
- Lower bounds
- Range reporting