Range Query Data Structures

Range Query Data Structures is a data structure designed to efficiently answer queries about aggregate information over a contiguous subarray or subrange of elements, distinguished by its optimization for multiple query operations such as sum, minimum, maximum, or count over specified intervals in logarithmic or constant time.

155

Publications

9.8K

Citations

358

Authors

154

Institutions

Publications per year

2017–2026

19

Variants

Range Query Data Structure

Authors

358

  1. DE
    Dan E. Willard

    University at Albany, State University of New York, United States

    7 publications · 766 citations

    7

    h-index

  2. KG
    Kasper Green Larsen

    Aarhus University, Denmark

    6 publications · 162 citations

    6

    h-index

  3. JS
    Jeffrey Scott Vitter

    Duke University, United States

    5 publications · 447 citations

    5

    h-index

  4. DG
    Dimitrios Gunopulos

    University of California, Riverside, United States

    4 publications · 425 citations

    4

    h-index

  5. GS
    George S. Lueker

    University of California, Irvine, United States

    4 publications · 251 citations

    4

    h-index

1–5 of 358

Venues

  1. SIAM Journal on Computing

    5 publications · 820 citations

    5

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 5 publications · 178 citations

    5

    h-index

  3. Symposium on Discrete Algorithms

    Conference · 4 publications · 157 citations

    4

    h-index

  4. Information Processing Letters

    4 publications · 423 citations

    4

    h-index

  5. ACM SIGMOD Record

    3 publications · 689 citations

    3

    h-index

1–5