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.

Kaile Huang

dblp:256/9368 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Distributed computing theory · 100%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › isolation levels
snapshot isolation
0.712023
Efficient Black-box Checking of Snapshot Isolation in Databases · Proc. VLDB Endow. 2023
Distributed computing theory › shared memory
atomic registers
0.412020
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers · PODC 2020
Distributed computing theory
impossibility results
0.412020
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers · PODC 2020
Distributed computing theory
shared memory
0.412020
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers · PODC 2020
Transaction processing and concurrency control
isolation levels
0.212023
Efficient Black-box Checking of Snapshot Isolation in Databases · Proc. VLDB Endow. 2023

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

generalized polygraph · 0.7constraint encoding · 0.7SMT solver · 0.7indistinguishability argument · 0.4chain argument · 0.4
YearPublicationVenuePosition
2023 Efficient Black-box Checking of Snapshot Isolation in Databases
abstract
Snapshot isolation (SI) is a prevalent weak isolation level that avoids the performance penalty imposed by serializability and simultaneously prevents various undesired data anomalies. Nevertheless, SI anomalies have recently been found in production cloud databases that claim to provide the SI guarantee. Given the complex and often unavailable internals of such databases, a black-box SI checker is highly desirable. In this paper we present PolySI, a black-box checker that efficiently checks SI and provides understandable counterexamples upon detecting violations. PolySI builds on a characterization of SI using generalized polygraphs (GPs), for which we establish its soundness and completeness. PolySI employs an SMT solver and also accelerates SMT solving by utilizing a compact constraint encoding of GPs and domain-specific optimizations for pruning constraints. As our extensive assessment demonstrates, PolySI successfully reproduces all of 2477 known SI anomalies, detects novel SI violations in three production cloud databases, identifies their causes, outperforms the state-of-the-art black-box checkers under a wide range of workloads, and can scale up to large workloads.
Kaile Huang, Si Liu 0003, Zhenge Chen, Hengfeng Wei, David A. Basin, Haixiang Li, Anqun Pan
Proc. VLDB Endow.1
2021 Byz-GentleRain: An Efficient Byzantine-Tolerant Causal Consistency Protocol
Kaile Huang, Hengfeng Wei, Yu Huang 0002, Haixiang Li, Anqun Pan
SSS1
2020 Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers
abstract
Distributed multi-writer atomic registers are at the heart of a large number of distributed algorithms. While enjoying the benefits of atomicity, researchers further explore fast implementations of atomic reigsters which are optimal in terms of data access latency. Though it is proved that multi-writer atomic register implementations are impossible when both read and write are required to be fast, it is still open whether implementations are impossible when only write or read is required to be fast. This work proves the impossibility of fast write implementations based on a series of chain arguments among indistiguishable executions. We also show the necessary and sufficient condition for fast read implementations by extending the results in the single-writer case. This work concludes a series of studies on fast implementations of distributed atomic registers.
Kaile Huang, Yu Huang 0002, Hengfeng Wei
PODC1