Improved Range Minimum Queries

被引：4
|
作者：
Ferrada, Hector [1 ]
Navarro, Gonzalo [1 ]
机构：
[1] Univ Chile, Ctr Biotechnol & Bioenginn, Dept Comp Sci, Beauchef 851, Santiago, Chile
来源：
2016 DATA COMPRESSION CONFERENCE (DCC) | 2016年
关键词：
TREES; REPRESENTATION;
D O I：
10.1109/DCC.2016.42
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Fischer and Heun [SICOMP 2011] proposed the first Range Minimum Query (RMQ) data structure on an array A[1, n] that uses 2n + o(n) bits and answers queries in 0(1) time without accessing A. Their scheme converts the Cartesian tree of A into a general tree, which is represented using DFUDS. We show that, by using instead the BP representation, the formula becomes simpler since border conditions are eliminated. This leads to the fastest and most compact practical implementation to date.
引用
收藏
页码：516 / 525
页数：10
相关论文
共 50 条
  • [1] Faster range minimum queries
    Kowalski, Tomasz M.
    Grabowski, Szymon
    SOFTWARE-PRACTICE & EXPERIENCE, 2018, 48 (11): : 2043 - 2060
  • [2] Compressed Range Minimum Queries
    Jo, Seungbum
    Mozes, Shay
    Weimann, Oren
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2018, 2018, 11147 : 206 - 217
  • [3] Compressed range minimum queries
    Gawrychowski, Pawel
    Jo, Seungbum
    Mozes, Shay
    Weimann, Oren
    THEORETICAL COMPUTER SCIENCE, 2020, 812 : 39 - 48
  • [4] Range minimum queries in minimal space
    Russo, Luis M. S.
    THEORETICAL COMPUTER SCIENCE, 2022, 909 : 19 - 38
  • [5] On Cartesian Trees and Range Minimum Queries
    Demaine, Erik D.
    Landau, Gad M.
    Weimann, Oren
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 341 - +
  • [6] Optimal Succinctness for Range Minimum Queries
    Fischer, Johannes
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 158 - 169
  • [7] On Cartesian Trees and Range Minimum Queries
    Demaine, Erik D.
    Landau, Gad M.
    Weimann, Oren
    ALGORITHMICA, 2014, 68 (03) : 610 - 625
  • [8] On Cartesian Trees and Range Minimum Queries
    Erik D. Demaine
    Gad M. Landau
    Oren Weimann
    Algorithmica, 2014, 68 : 610 - 625
  • [9] Two-dimensional range minimum queries
    Amir, Amihood
    Fischer, Johannes
    Lewenstein, Moshe
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 286 - +
  • [10] Improved bounds for range mode and range median queries
    Petersen, Holger
    SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 418 - 423
12345