Concepedia

Buffered Search Trees

Buffered Search Trees is a type of external memory search tree data structure that incorporates buffering mechanisms at internal nodes to aggregate insertions and queries, thereby reducing the number of I/O operations by delaying and batching updates in a multi-level hierarchy.

3

Publications

56

Citations

7

Authors

5

Institutions

Publications per year

2017–2026

0

Parents

Publications

3

1–3 of 3

Authors

7

  1. PJ
    Peiquan Jin

    University of Science and Technology of China, China

    1 publications · 11 citations

    1

    h-index

  2. LY
    Lihua Yue

    University of Science and Technology of China, China

    1 publications · 11 citations

    1

    h-index

  3. CY
    Chengcheng Yang

    University of Electronic Science and Technology of China, China

    1 publications · 11 citations

    1

    h-index

  4. PY
    Puyuan Yang

    University of Science and Technology of China, China

    1 publications · 11 citations

    1

    h-index

  5. YE
    Yi-Hua E. Yang

    University of Southern California, United States

    1 publications · 22 citations

    1

    h-index

1–5 of 7

Institutions

5

  1. Chinese Academy of Sciences

    Beijing, China

    1 h-index

    2 publications

    22 citations

  2. University of Science and Technology of China

    Hefei, China

    1 h-index

    4 publications

    44 citations

  3. University of Southern California

    Los Angeles, United States

    1 h-index

    2 publications

    44 citations

  4. Hefei Institutes of Physical Science

    Hefei, China

    1 h-index

    2 publications

    22 citations

  5. Aarhus University

    Aarhus, Denmark

    1 h-index

    1 publications

    23 citations

1–5 of 5

Venues

  1. International Journal of Parallel Programming

    1 publications · 11 citations

    1

    h-index

  2. BRICS Report Series

    1 publications · 23 citations

    1

    h-index

1–2