Lsm Tree Storage

LSM Tree Storage is a storage engine architecture that organizes data in a hierarchy of sorted runs, optimized for write-heavy workloads by batching writes and performing sequential disk compactions to maintain sorted structure.

75

Publications

3.7K

Citations

269

Authors

78

Institutions

Publications per year

2017–2026

58

Variants

Log-structured Merge-tree Storage

Authors

269

  1. MJ
    Michael J. Carey

    University of Wisconsin–Madison, United States

    6 publications · 395 citations

    6

    h-index

  2. YX
    Yinlong Xu

    University of Science and Technology of China, China

    6 publications · 151 citations

    6

    h-index

  3. ND
    Niv Dayan

    Harvard University Press, United States

    6 publications · 596 citations

    6

    h-index

  4. MA
    Manos Athanassoulis

    École Polytechnique Fédérale de Lausanne, Switzerland

    6 publications · 372 citations

    6

    h-index

  5. JW
    Jiguang Wan

    Huazhong University of Science and Technology, China

    5 publications · 135 citations

    5

    h-index

1–5 of 269

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 13 publications · 703 citations

    12

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 129 citations

    5

    h-index

  3. ACM Transactions on Storage

    TOS · 5 publications · 359 citations

    5

    h-index

  4. IEEE Access

    3 publications · 38 citations

    3

    h-index

  5. ACM Transactions on Architecture and Code Optimization

    TACO · 2 publications · 52 citations

    2

    h-index

1–5