Lesson:corobase coroutine oriented main memory database engine c4a28018
| 제목 | CoroBase: Coroutine-Oriented Main-Memory Database Engine |
|---|---|
| 궁금했던 점 | Can main-memory OLTP hide pointer-chasing stalls without rewriting the database around manual continuations? |
| 해본 것 | CoroBase expresses each transaction as a coroutine and interleaves transactions to batch memory accesses and issue software prefetches while retaining the transaction API. |
| 당시 조건 | Venue: VLDB. Year: 2021.
Modern in-memory engines are often memory-latency bound, but conventional batching complicates transaction code. Verification: full_text; confidence=high. |
| 실제 결과 | workloads=read-intensive and mixed OLTP on a 48-core server; baselines=conventional main-memory execution; metrics=transaction throughput; scalability; results=close to 2x on read-intensive workloads |
| 왜 그랬는지 | Language/runtime continuations can hide latency while preserving readable transactional control flow. |
| 다음에 기억할 것 | Use coroutines to interleave independent requests around predictable long-latency accesses. |
| 언제 맞는지 | Main-memory databases with pointer-heavy read paths.
Limits: Benefits shrink for compute/write-heavy workloads and depend on useful prefetch distance and batching concurrency. |
| 신뢰도 | 높음 |
| 관련 자료 | CoroBase: Coroutine-Oriented Main-Memory Database Engine. VLDB 2021. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:57:05.514671Z |
| 마지막 수정 시각 (UTC) | 2026-07-18T14:58:24.422450Z |
근거 ev_3d65534516ff4843: CoroBase: Coroutine-Oriented Main-Memory Database Engine. VLDB 2021.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:57:06.511160Z
Bibliographic paper record.
근거 verified-content-v1-0073: Yongjun He et al., "CoroBase: Coroutine-Oriented Main-Memory Database Engine", PVLDB 2021.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:43:25.907855Z
Verification: full_text; confidence=high.
Question: Can main-memory OLTP hide pointer-chasing stalls without rewriting the database around manual continuations?
Context: Modern in-memory engines are often memory-latency bound, but conventional batching complicates transaction code.
Method: CoroBase expresses each transaction as a coroutine and interleaves transactions to batch memory accesses and issue software prefetches while retaining the transaction API.
Evaluation: workloads=read-intensive and mixed OLTP on a 48-core server; baselines=conventional main-memory execution; metrics=transaction throughput; scalability; results=close to 2x on read-intensive workloads
Interpretation: Language/runtime continuations can hide latency while preserving readable transactional control flow.
Reusable lesson: Use coroutines to interleave independent requests around predictable long-latency accesses.
Applicability: Main-memory databases with pointer-heavy read paths.
Limits: Benefits shrink for compute/write-heavy workloads and depend on useful prefetch distance and batching concurrency.
근거 canonical-paper-v2-c4a28018: Yongjun He et al., "CoroBase: Coroutine-Oriented Main-Memory Database Engine", PVLDB 2021.
(원문 열기)
논문 · 확인 범위: 원문 확인 · S3ResearchAgent · 2026-07-18T05:15:33.011568Z
Verification: full_text; confidence=high.
Question: Can main-memory OLTP hide pointer-chasing stalls without rewriting the database around manual continuations?
Context: Modern in-memory engines are often memory-latency bound, but conventional batching complicates transaction code.
Method: CoroBase expresses each transaction as a coroutine and interleaves transactions to batch memory accesses and issue software prefetches while retaining the transaction API.
Evaluation: workloads=read-intensive and mixed OLTP on a 48-core server; baselines=conventional main-memory execution; metrics=transaction throughput; scalability; results=close to 2x on read-intensive workloads
Interpretation: Language/runtime continuations can hide latency while preserving readable transactional control flow.
Reusable lesson: Use coroutines to interleave independent requests around predictable long-latency accesses.
Applicability: Main-memory databases with pointer-heavy read paths.
Limits: Benefits shrink for compute/write-heavy workloads and depend on useful prefetch distance and batching concurrency.
자료 검증 verify_087dd04a45fdffde3446:
ev_3d65534516ff4843 ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:24.198845Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=2074229397819ffad72becb3a53fcec826b446e8d5c89138e9dc9d1c00f1b67e / 위치: 보존 파일 objects/sha256/20/2074229397819ffad72becb3a53fcec826b446e8d5c89138e9dc9d1c00f1b67e
보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함.
자료 검증 verify_a384e41b0c0ab749e9e8:
verified-content-v1-0073 ·
판단 보류
확인 범위: 서지정보만 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:24.422450Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=2074229397819ffad72becb3a53fcec826b446e8d5c89138e9dc9d1c00f1b67e / 위치: 보존 파일 objects/sha256/20/2074229397819ffad72becb3a53fcec826b446e8d5c89138e9dc9d1c00f1b67e
보존 객체는 cookie/landing page이므로 서지 위치만 확인했고 본문 주장을 검증하지 못함.