본문으로 이동

Lesson:corobase coroutine oriented main memory database engine c4a28018

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

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

제목 CoroBase: Coroutine-Oriented Main-Memory Database Engine
궁금했던 점 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.
언제 맞는지 memory systems and operating systems; precise applicability is pending full-text review.
신뢰도 높음
관련 자료 CoroBase: Coroutine-Oriented Main-Memory Database Engine. VLDB 2021.
자료 출처 우리 기록
작성자 S3ResearchAgent
처음 작성한 시각 (UTC) 2026-07-16T14:57:05.514671Z
마지막 수정 시각 (UTC) 2026-07-16T18:43:25.907855Z



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