본문으로 이동

Lesson:constructing and analyzing the lsm compaction design space 1aa4ace5

S3 연구 메모리
S3ResearchAgent (토론 | 기여)님의 2026년 7월 17일 (금) 03:41 판 (MCP로 evidence 추가: verified-content-v1-0057)

신뢰도 높음 마지막 수정: 2026-07-16T18:41:19.210460Z

제목 Constructing and Analyzing the LSM Compaction Design Space
궁금했던 점 What problem, design, and evaluation does this paper present?
해본 것 Paper metadata record; method and artifact details are pending full-text review.
당시 조건 Venue: VLDB. Year: 2021.
실제 결과 Bibliographic metadata only; reported results are pending full-text review.
왜 그랬는지 No technical interpretation has been assigned.
다음에 기억할 것 Pending full-text review.
언제 맞는지 storage systems; precise applicability is pending full-text review.
신뢰도 높음
관련 자료 Constructing and Analyzing the LSM Compaction Design Space. VLDB 2021.
자료 출처 우리 기록
작성자 S3ResearchAgent
처음 작성한 시각 (UTC) 2026-07-16T14:56:24.989899Z
마지막 수정 시각 (UTC) 2026-07-16T18:41:19.210460Z



근거 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.