Lesson:mitigating resource usage dependency in sorting based kv stores on hybrid storage devices via op 31cbb8ad
| 제목 | Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation Decoupling |
|---|---|
| 궁금했던 점 | Can LSM key-value stores reduce compaction and CPU coupling by managing indexes separately from values? |
| 해본 것 | DecouKV uses mergeable skip-list indexes, append-only value data, elastic level capacities, and parameterized request queues. |
| 당시 조건 | Venue: USENIX ATC. Year: 2025.
Coupled index/data compaction amplifies writes, consumes CPU, and causes tail latency. Verification: official USENIX page and abstract; confidence=high. |
| 실제 결과 | workloads=write-intensive and read-intensive key-value workloads; baselines=RocksDB, MatrixKV, PrismDB, SplitDB, ADOC; metrics=CPU utilization, throughput, tail latency; results=+25.4–32.3% CPU utilization; 2.3–4.9x write throughput; 74.3–91.4% lower tail; 1.2–2.3x read throughput |
| 왜 그랬는지 | Separating lightweight index merging from value placement removes avoidable data rewriting. |
| 다음에 기억할 것 | Split metadata evolution from immutable payload placement when their update lifecycles differ. |
| 언제 맞는지 | SSD-backed ordered key-value stores with LSM-style indexing.
Limits: Results are tied to evaluated storage devices, queue tuning, and workload mixes. |
| 신뢰도 | 중간 |
| 관련 자료 | Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation Decoupling. USENIX ATC 2025. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:59:09.319302Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T14:58:44.879751Z |
근거 ev_cfe38bb252804eec: Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation Decoupling. USENIX ATC 2025.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:59:11.337126Z
Bibliographic paper record.
근거 verified-content-v1-0117: Qingyang Zhang et al., "DecouKV: Decoupled Index and Data Management for High-Performance Key-Value Stores", USENIX ATC 2025.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:44:55.711551Z
Verification: official USENIX page and abstract; confidence=high.
Canonical title: DecouKV: Decoupled Index and Data Management for High-Performance Key-Value Stores
Question: Can LSM key-value stores reduce compaction and CPU coupling by managing indexes separately from values?
Context: Coupled index/data compaction amplifies writes, consumes CPU, and causes tail latency.
Method: DecouKV uses mergeable skip-list indexes, append-only value data, elastic level capacities, and parameterized request queues.
Evaluation: workloads=write-intensive and read-intensive key-value workloads; baselines=RocksDB, MatrixKV, PrismDB, SplitDB, ADOC; metrics=CPU utilization, throughput, tail latency; results=+25.4–32.3% CPU utilization; 2.3–4.9x write throughput; 74.3–91.4% lower tail; 1.2–2.3x read throughput
Interpretation: Separating lightweight index merging from value placement removes avoidable data rewriting.
Reusable lesson: Split metadata evolution from immutable payload placement when their update lifecycles differ.
Applicability: SSD-backed ordered key-value stores with LSM-style indexing.
Limits: Results are tied to evaluated storage devices, queue tuning, and workload mixes.
근거 canonical-paper-v2-31cbb8ad: Qingyang Zhang et al., "Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation Decoupling", USENIX ATC 2025.
(원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:29:47.156340Z
Verification: official USENIX page and abstract; confidence=medium.
Canonical title: Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid Storage Devices via Operation Decoupling
Question: Can LSM key-value stores reduce compaction and CPU coupling by managing indexes separately from values?
Context: Coupled index/data compaction amplifies writes, consumes CPU, and causes tail latency.
Method: DecouKV uses mergeable skip-list indexes, append-only value data, elastic level capacities, and parameterized request queues.
Evaluation: workloads=write-intensive and read-intensive key-value workloads; baselines=RocksDB, MatrixKV, PrismDB, SplitDB, ADOC; metrics=CPU utilization, throughput, tail latency; results=+25.4–32.3% CPU utilization; 2.3–4.9x write throughput; 74.3–91.4% lower tail; 1.2–2.3x read throughput
Interpretation: Separating lightweight index merging from value placement removes avoidable data rewriting.
Reusable lesson: Split metadata evolution from immutable payload placement when their update lifecycles differ.
Applicability: SSD-backed ordered key-value stores with LSM-style indexing.
Limits: Results are tied to evaluated storage devices, queue tuning, and workload mixes.
자료 검증 verify_f72c5cc31591f177cb79:
ev_cfe38bb252804eec ·
판단 보류
확인 범위: 일부 자료 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:44.879751Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=549e0cb98092e6df165a68a53b0524f8a3d06e617d336d98e1319d73ffdc42e4 / 위치: 보존 파일 objects/sha256/54/549e0cb98092e6df165a68a53b0524f8a3d06e617d336d98e1319d73ffdc42e4
보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.