May 1, 2023 · The LSM RUM-tree introduces new strategies to control the size of the Update Memo to make sure it always fits in memory for high performance.

May 1, 2023 · Abstract Many applications require update-intensive workloads on spatial objects, e.g., social-network ser- vices and shared-riding services ...

We investigate the augmentation of a main-memory-based memo structure into an LSM secondary index structure to handle update-intensive workloads efficiently. We ...

Apr 1, 2021 · Multicopy search structures such as log-structured merge (LSM) trees are optimized for high insert/update/delete (collectively known as upsert) ...

Nov 30, 2023 · B-trees are read-optimized and not so write-optimized. Writes are slower because updating a B-Tree means random IO. · LSM trees are write- ...

Sep 29, 2023 · This dissertation focuses on the efficient support of update-intensive workloads for LSM-based indexes.

In this paper, we present an R-tree variant, termed the RUM-tree (stands for R-tree with Update Memo) that minimizes the cost of object updates. The RUM-tree ...

An Update-intensive LSM-based R-tree Index. Preprint. Full-text available. May 2023. Jaewoo Shin · Jianguo Wang · Walid G. Aref. Many applications ...

The LSM RUM-tree: a log structured merge R-tree for update-intensive spatial workloads ... An update-intensive lsm-based r-tree index. J Shin, J Wang, WG Aref.

Mar 25, 2022 · This paper proposes an ER-tree(embedded R-tree) index structure based on the orderliness of LSM-tree data.