Data Structures for Range Minimum Queries in Multidimensional Arrays

Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied intensively because of its relevance to the Nearest Common Ancestor problem and its important use in stringology. If constant-time query answering is required, linear time and space preprocessing algorithms were known for the 1D case, but not for the higher dimensional cases. In this paper, we give the first linear-time preprocessing algorithm for arrays with fixed dimension, such that any range minimum query can be answered in constant time.

• Type: Conference
• Year: 2010
• Where: SODA
• Authors: Hao Yuan, Mikhail J. Atallah
• Keywords: Constant-time Query Answering, Discrete Algorithms, Range Minimum Query, SODA 2010, Space Preprocessing Algorithms