Lesson:constructing and analyzing the lsm compaction design space 1aa4ace5
| 제목 | Constructing and Analyzing the LSM Compaction Design Space |
|---|---|
| 궁금했던 점 | Can LSM-tree compaction policies be expressed as a systematic design space rather than isolated named strategies? |
| 해본 것 | The paper decomposes compaction into trigger, data layout, granularity, and data movement, then instantiates and analyzes ten strategies. |
| 당시 조건 | Venue: VLDB. Year: 2021.
Compaction choices trade write, read, and space amplification, but prior systems mix several design decisions. Verification: full_text; confidence=high. |
| 실제 결과 | workloads=ten instantiated compaction strategies; baselines=representative leveling, tiering, and hybrid policies; metrics=write amplification; write throughput; point lookup; range lookup; space amplification;.; results=12 empirical observations; seven design takeaways; no universal winner |
| 왜 그랬는지 | Separating policy primitives reveals which choice causes each tradeoff and enables deliberate hybrid designs. |
| 다음에 기억할 것 | Factor a policy into orthogonal primitives before comparing implementations. |
| 언제 맞는지 | LSM key-value stores and compaction-policy design.
Limits: The explored strategies and workloads do not exhaust the design space, and the study does not provide an online adaptive selector. |
| 신뢰도 | 높음 |
| 관련 자료 | Constructing and Analyzing the LSM Compaction Design Space. VLDB 2021. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:56:24.989899Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T14:58:23.779772Z |
근거 ev_15e11c2df17e4cfc: Constructing and Analyzing the LSM Compaction Design Space. VLDB 2021.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:56:26.003019Z
Bibliographic paper record.
근거 verified-content-v1-0057: Subhadeep Sarkar et al., "Constructing and Analyzing the LSM Compaction Design Space", PVLDB 2021.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:41:19.210460Z
Verification: full_text; confidence=high.
Question: Can LSM-tree compaction policies be expressed as a systematic design space rather than isolated named strategies?
Context: Compaction choices trade write, read, and space amplification, but prior systems mix several design decisions.
Method: The paper decomposes compaction into trigger, data layout, granularity, and data movement, then instantiates and analyzes ten strategies.
Evaluation: workloads=ten instantiated compaction strategies; baselines=representative leveling, tiering, and hybrid policies; metrics=write amplification; write throughput; point lookup; range lookup; space amplification;...; results=12 empirical observations; seven design takeaways; no universal winner
Interpretation: Separating policy primitives reveals which choice causes each tradeoff and enables deliberate hybrid designs.
Reusable lesson: Factor a policy into orthogonal primitives before comparing implementations.
Applicability: LSM key-value stores and compaction-policy design.
Limits: The explored strategies and workloads do not exhaust the design space, and the study does not provide an online adaptive selector.
근거 canonical-paper-v2-1aa4ace5: Subhadeep Sarkar et al., "Constructing and Analyzing the LSM Compaction Design Space", PVLDB 2021.
(원문 열기)
논문 · 확인 범위: 원문 확인 · S3ResearchAgent · 2026-07-18T05:14:27.531558Z
Verification: full_text; confidence=high.
Question: Can LSM-tree compaction policies be expressed as a systematic design space rather than isolated named strategies?
Context: Compaction choices trade write, read, and space amplification, but prior systems mix several design decisions.
Method: The paper decomposes compaction into trigger, data layout, granularity, and data movement, then instantiates and analyzes ten strategies.
Evaluation: workloads=ten instantiated compaction strategies; baselines=representative leveling, tiering, and hybrid policies; metrics=write amplification; write throughput; point lookup; range lookup; space amplification;.; results=12 empirical observations; seven design takeaways; no universal winner
Interpretation: Separating policy primitives reveals which choice causes each tradeoff and enables deliberate hybrid designs.
Reusable lesson: Factor a policy into orthogonal primitives before comparing implementations.
Applicability: LSM key-value stores and compaction-policy design.
Limits: The explored strategies and workloads do not exhaust the design space, and the study does not provide an online adaptive selector.
자료 검증 verify_36f583fb33919bd79441:
ev_15e11c2df17e4cfc ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:23.507581Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=808850cf349280461fa8da5fddc8e935a44645a30a5c8cab0e7010f36d7f9503 / 위치: 보존 파일 objects/sha256/80/808850cf349280461fa8da5fddc8e935a44645a30a5c8cab0e7010f36d7f9503
보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함.
자료 검증 verify_7c36566f56a542160a00:
verified-content-v1-0057 ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:23.779772Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=808850cf349280461fa8da5fddc8e935a44645a30a5c8cab0e7010f36d7f9503 / 위치: 보존 파일 objects/sha256/80/808850cf349280461fa8da5fddc8e935a44645a30a5c8cab0e7010f36d7f9503
보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함.