Range Minimum Query Indexes in Higher Dimensions

Range minimum queries (RMQs) are essential in many algorithmic procedures. The problem is to prepare a data structure on an array to allow for fast subsequent queries that find the minimum within a range in the array. We study the problem of designing indexing RMQ data structures which only require sub-linear space and access to the input array while querying. The RMQ problem in one-dimensional arrays is well understood with known indexing data structures achieving optimal space and query time. The two-dimensional indexing RMQ data structures have received the attention of researchers recently. There are also several solutions for the RMQ problem in higher dimensions. Yuan and Atallah [SODA’10] designed a brilliant data structure of size \(O(N)\) which supports RMQs in a multi-dimensional array of size \(N\) in constant time for a constant number of dimensions. In this paper we consider the problem of designing indexing data structures for RMQs in higher dimensions. We design a data structure of size \(O(N)\) bits that supports RMQs in constant time for a constant number of dimensions. We also show how to obtain trade-offs between the space of indexing data structures and their query time.

[1]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[2]  Moshe Lewenstein,et al.  Two-Dimensional Range Minimum Queries , 2007, CPM.

[3]  Volker Heun,et al.  Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays , 2011, SIAM J. Comput..

[4]  Gad M. Landau,et al.  Range LCP , 2011, ISAAC.

[5]  Kunihiko Sadakane,et al.  Succinct data structures for flexible text retrieval systems , 2007, J. Discrete Algorithms.

[6]  S. Srinivasa Rao,et al.  On Space Efficient Two Dimensional Range Minimum Data Structures , 2011, Algorithmica.

[7]  Gad M. Landau,et al.  On Cartesian Trees and Range Minimum Queries , 2009, Algorithmica.

[8]  Rajeev Raman,et al.  Encoding 2D Range Maximum Queries , 2011, ISAAC.

[9]  John Iacono,et al.  Encoding 2-D Range Maximum Queries , 2016, Theor. Comput. Sci..

[10]  Mikhail J. Atallah,et al.  Data structures for range minimum queries in multidimensional arrays , 2010, SODA '10.

[11]  Kasper Green Larsen,et al.  Orthogonal Range Reporting in Three and Higher Dimensions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Bernard Chazelle,et al.  The complexity of computing partial sums off-line , 1991, Int. J. Comput. Geom. Appl..

[13]  Moshe Lewenstein,et al.  Two dimensional range minimum queries and Fibonacci lattices , 2012, Theor. Comput. Sci..

[14]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[15]  Jean Vuillemin,et al.  A unifying look at data structures , 1980, CACM.