### Abstract

We consider the two-dimensional range maximum query (2D-RMQ) problem: given an array containing elements from an ordered set, encode the array so that the position of the maximum element in any specified range of rows and range of columns can be found efficiently. We focus on determining the effective entropy of 2D-RMQ, i.e., how many bits are needed to encode an array so that 2D-RMQ queries can be answered without accessing the array. We give tight upper and lower bounds on the expected effective entropy for the case when A contains independent identically-distributed random values, and give new upper and lower bounds for the case when the array contains few rows. The latter results improve upon the upper and lower bounds by Brodal et al. [4]. We also give some efficient data structures for 2D-RMQ whose space usage is close to the effective entropy.

Original language | English (US) |
---|---|

Pages (from-to) | 316-327 |

Number of pages | 12 |

Journal | Theoretical Computer Science |

Volume | 609 |

DOIs | |

State | Published - Jan 4 2016 |

### Fingerprint

### Keywords

- Cartesian trees
- Effective entropy
- Encoding model
- Indexing model
- Range maximum queries

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*609*, 316-327. https://doi.org/10.1016/j.tcs.2015.10.012