EDBT 2026 Demo / reviewers in the wild / expert
Qiuli Huang
dblp:275/9672
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Transaction processing and concurrency control · 61% Distributed and cloud data management · 30% Database system architecture and tuning · 9% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transaction processing and concurrency control
distributed transaction processing |
0.6 | 1 | 2022 | Karst: Transactional Data Ingestion Without Blocking on a Scalable Architecture · IEEE Trans. Knowl. Data Eng. 2022 |
Transaction processing and concurrency control
two-phase commit avoidance |
0.6 | 1 | 2022 | Karst: Transactional Data Ingestion Without Blocking on a Scalable Architecture · IEEE Trans. Knowl. Data Eng. 2022 |
Methods — techniques the papers use, named apart from their topics
lightweight logging · 0.6lazy persistence · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Karst: Transactional Data Ingestion Without Blocking on a Scalable ArchitectureabstractAlthough real-time analytics on the up-to-date dataset has become an emerging demand, many big data systems are still designed for offline analytics. Particularly, for critical applications like Fintech,transactional data ingestionensures a timely, always-correct, and scalable dataset. To carry out append-only ingestion, existing OLTP/HTAP systems are based on strict transactions with imperfect scalability, while NoSQL-like systems support scalable but relaxed transactions. How to ensure essential transactional guarantees without harming scalability seems to be a non-trivial issue. This paper proposesKarstto bring transactional data ingestion for existing offline analytics. We notice that blockingtwo-phase commit(2PC) to resolve transactional data ingestion is a performance killer for the partitioned analytical systems. Karst introduces a scalable protocol calledmetadata-oriented commit(MOC) that converts each distributed transaction into multiple partial transactions to avoid 2PC. Moreover, to ingest massive data into plenty of partitions, Karst also employs lazy persistence, lightweight logging, and optimized data traffic. In experiments, Karst could achieve up to about 2x$\sim$10x performance over relevant systems and also shows remarkable scalability. Beicheng Peng, Qiuli Huang, Chuliang Weng |
IEEE Trans. Knowl. Data Eng. | 3 |