Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Wuh-Chwen Hwang

dblp:337/3094 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0009-0007-8819-4901ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 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
2 papers
Transaction processing and concurrency control · 73% Distributed and cloud data management · 27%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › concurrency control
optimistic concurrency control
0.712023
Polaris: Enabling Transaction Priority in Optimistic Concurrency Control · Proc. ACM Manag. Data 2023
Transaction processing and concurrency control › transaction scheduling
transaction prioritization
0.712023
Polaris: Enabling Transaction Priority in Optimistic Concurrency Control · Proc. ACM Manag. Data 2023
Distributed and cloud data management › cloud database
cloud-native database
0.612022
Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation · Proc. VLDB Endow. 2022
Distributed and cloud data management › distributed database architecture
disaggregated storage
0.612022
Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation · Proc. VLDB Endow. 2022
Transaction processing and concurrency control
distributed commit protocols
0.612022
Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation · Proc. VLDB Endow. 2022
Transaction processing and concurrency control
distributed transaction processing
0.612022
Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation · Proc. VLDB Endow. 2022
Transaction processing and concurrency control › distributed commit protocols
two-phase commit
0.612022
Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation · Proc. VLDB Endow. 2022
Distributed systems
fault tolerance
0.212022
Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation · Proc. VLDB Endow. 2022

Methods — techniques the papers use, named apart from their topics

atomic compare-and-swap · 1.1reservation mechanism · 0.7abort-aware priority assignment · 0.7
YearPublicationVenuePosition
2023 Polaris: Enabling Transaction Priority in Optimistic Concurrency Control
abstract
Transaction priority is a critical feature for real-world database systems. Under high contention, certain classes of transactions should be given a higher chance to commit than others. Such a prioritization mechanism is commonly implemented in locking-based concurrency control protocols as some lock scheduling mechanisms, but it is rarely supported in the world of optimistic concurrency control. We present Polaris, an optimistic concurrency control protocol that supports multiple priority levels. To enforce priority, Polaris introduces a minimal amount of pessimism through a lightweight reservation mechanism. The protocol is fully optimistic among transactions within the same priority level and preserves the high throughput advantage of optimistic protocols. Our evaluation with YCSB workload shows that Polaris can make the p999 tail latency of high-priority transactions 13x lower than that of low-priority ones. With an abort-aware priority assignment policy, Polaris can deliver 1.9x higher throughput and 17x lower tail latency compared to Silo for high-contention workloads.
Chenhao Ye, Wuh-Chwen Hwang, Xiangyao Yu
Proc. ACM Manag. Data2
2022 Cornus: Atomic Commit for a Cloud DBMS with Storage Disaggregation
abstract
Two-phase commit (2PC) is widely used in distributed databases to ensure atomicity of distributed transactions. Conventional 2PC was originally designed for the shared-nothing architecture and has two limitations: long latency due to two eager log writes on the critical path, and blocking of progress when a coordinator fails. Modern cloud-native databases are moving to a storage disaggregation architecture where storage is a shared highly-available service. Our key observation is that disaggregated storage enables protocol innovations that can address both the long-latency and blocking problems. We develop Cornus, an optimized 2PC protocol to achieve this goal. The only extra functionality Cornus requires is an atomic compare-and-swap capability in the storage layer, which many existing storage services already support. We present Cornus in detail and show how it addresses the two limitations. We also deploy it on real storage services including Azure Blob Storage and Redis. Empirical evaluations show that Cornus can achieve up to 1.9X latency reduction over conventional 2PC.
Zhihan Guo, Xinyu Zeng, Wuh-Chwen Hwang, Ziwei Ren, Xiangyao Yu, Mahesh Balakrishnan 0001, Philip A. Bernstein
Proc. VLDB Endow.4