Optimal Succinctness for Range Minimum Queries

For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into a scheme of size 2n+o(n) bits that allows to answer range minimum queries on A in constant time. This space is asymptotically optimal in the important setting where access to A is not permitted after the preprocessing step. Our scheme can be computed in linear time, using only n+o(n) additional bits for construction. We also improve on LCA-computation in BPS- or DFUDS-encoded trees.

[1]  Gonzalo Navarro,et al.  Compressed full-text indexes , 2007, CSUR.

[2]  Robert E. Tarjan,et al.  Finding dominators revisited: extended abstract , 2004, SODA '04.

[3]  Naila Rahman,et al.  A simple optimal representation for balanced parentheses , 2006, Theor. Comput. Sci..

[4]  Paolo Ferragina,et al.  Indexing compressed text , 2005, JACM.

[5]  Maxime Crochemore,et al.  Improved Algorithms for the Range Next Value Problem and Applications , 2008, STACS.

[6]  Roberto Grossi,et al.  High-order entropy-compressed text indexes , 2003, SODA '03.

[7]  John L. Smith.  Tables , 1969, Neuromuscular Disorders.

[8]  Roberto Grossi,et al.  Amortized Rigidness in Dynamic Cartesian Trees , 2006, STACS.

[9]  Gonzalo Navarro,et al.  Compressed representations of sequences and full-text indexes , 2007, TALG.

[10]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Roberto Grossi,et al.  Squeezing succinct data structures into entropy bounds , 2006, SODA '06.

[12]  Veli Mäkinen,et al.  Space-Efficient Algorithms for Document Retrieval , 2007, CPM.

[13]  Volker Heun,et al.  A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array , 2007, ESCAPE.

[14]  Enno Ohlebusch,et al.  Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.

[15]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[16]  Peter Bro Miltersen,et al.  The Cell Probe Complexity of Succinct Data Structures , 2003 .

[17]  Alexander Golynski.  Optimal lower bounds for rank and select indexes , 2007, Theor. Comput. Sci..

[18]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[19]  Gonzalo Navarro,et al.  Fully-functional succinct trees , 2010, SODA '10.

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

[21]  Steven Skiena,et al.  Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.

[22]  Fabrizio Luccio,et al.  Structuring labeled trees for optimal succinctness, and beyond , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[23]  Johannes Fischer,et al.  Advantages of Shared Data Structures for Sequences of Balanced Parentheses , 2010, 2010 Data Compression Conference.

[24]  Stephen Alstrup,et al.  Nearest common ancestors: a survey and a new distributed algorithm , 2002, SPAA.

[25]  Uzi Vishkin,et al.  Recursive Star-Tree Parallel Data Structure , 1993, SIAM J. Comput..

[26]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[27]  Kunihiko Sadakane,et al.  Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.

[28]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.

[29]  S. Muthukrishnan,et al.  Efficient algorithms for document retrieval problems , 2002, SODA '02.

[30]  C. SIAMJ..  LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME , 2001 .

[31]  Rajeev Raman,et al.  Representing Trees of Higher Degree , 2005, Algorithmica.

[32]  Kunihiko Sadakane,et al.  New text indexing functionalities of the compressed suffix arrays , 2003, J. Algorithms.

[33]  Volker Heun,et al.  Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries , 2008, Data Compression Conference (dcc 2008).

[34]  Sanjeev Saxena.  Dominance made simple , 2009, Inf. Process. Lett..

[35]  Giovanni Manzini,et al.  An analysis of the Burrows-Wheeler transform , 2001, SODA '99.

[36]  Gonzalo Navarro,et al.  Faster entropy-bounded compressed suffix trees , 2009, Theor. Comput. Sci..

[37]  Wing-Kai Hon,et al.  Breaking a time-and-space barrier in constructing full-text indices , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[39]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[40]  Roberto Grossi,et al.  Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..

[41]  Robert E. Tarjan,et al.  Finding Dominators Revisited , 2004, SODA 2004.

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

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

[44]  Gonzalo Navarro,et al.  An(other) Entropy-Bounded Compressed Suffix Tree , 2008, CPM.

[45]  Kunihiko Sadakane,et al.  Ultra-succinct representation of ordered trees , 2007, SODA '07.