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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xieyun Fang

dblp:147/7712 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Security and privacy · 1Databases, 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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › concurrency control
multiversion concurrency control
0.912025
K2: On Optimizing Distributed Transactions in a Multi-region Data Store with True-time Clocks · Proc. VLDB Endow. 2025
Transaction processing and concurrency control › concurrency control
timestamp-based concurrency control
0.912025
K2: On Optimizing Distributed Transactions in a Multi-region Data Store with True-time Clocks · Proc. VLDB Endow. 2025
Distributed systems › distributed database
distributed transactions
0.912025
K2: On Optimizing Distributed Transactions in a Multi-region Data Store with True-time Clocks · Proc. VLDB Endow. 2025
Distributed systems › replication
geo-replication
0.312025
K2: On Optimizing Distributed Transactions in a Multi-region Data Store with True-time Clocks · Proc. VLDB Endow. 2025
Distributed systems
replication
0.312025
K2: On Optimizing Distributed Transactions in a Multi-region Data Store with True-time Clocks · Proc. VLDB Endow. 2025

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

visibility control protocol · 1.7truetime clock · 1.7
YearPublicationVenuePosition
2025 K2: On Optimizing Distributed Transactions in a Multi-region Data Store with True-time Clocks
abstract
TrueTime clocks (TTCs) that offer accurate and reliable time within limited uncertainty bounds have been increasingly implemented in many clouds. Multi-region data stores that seek decentralized synchronization for high performance represent an ideal application of TTC. However, the co-designs between the two often failed to realize their full potential. This paper proposes K2, a multi-region data store that explores the opportunity of using TTC for distributed transactions. Compared to its pioneer, Google Spanner, K2 augments TTC's semantics in three core design pillars. First, K2 carries a new timestamp-generating scheme that is capable of providing a small time uncertainty bound at scale. Second, K2 revitalizes existing multi-version timestamp-ordered concurrency control to realize multi-version properties for read-write transactions. Third, K2 introduces a new TTC-based visibility control protocol that provides efficient reads at replicas. Our evaluation shows that, K2 achieves an order of magnitude higher transaction throughput relative to other geo-distributed transaction protocols while ensuring a lower visibility delay at asynchronous replicas.
Haoze Song, Xusheng Chen, Yazhi Feng, Xieyun Fang, Heming Cui, Linghe Kong
Proc. VLDB Endow.6
2013 Revisiting Behavior Amplification of NAND Flash-Based Storage Devices in Embedded Systems
abstract
NAND Flash-based devices (e.g., Solid State Disks) emerge as popular storage devices with ultra-fast performance in embedded systems. Previously, write amplification (i.e., page program operation amplification), resulting from restriction operations (i.e., out-of-place update and erase-before-write operations) in NAND Flash, is an essential metric to evaluate excessive page program operations in NAND Flash space and write endurance of NAND Flash. However, overhead caused by read and erase operations is not taken into account by write amplification. This typical overhead gives rise to bad impacts on data reliability in NAND Flash space as long as scaling of NAND flash memory process technology. In this paper, we propose a new evaluation metric called Bamp to explore all behaviors amplification (i.e., read, program, and erase) in NAND Flash-based devices. We obtain the value of Bamp in the term of energy consumption when user data is written to devices. Given a write-dominated workload condition, there are also excessive read and erase operations besides extra program operations in storage devices of embedded systems. Therefore, write amplification cannot comprehensively evaluate amplification behaviors in NAND Flash-based devices based on given amounts of written data in workload. We employ a measurement system to obtain the values of Bamp for NAND Flash-based devices in the term of energy consumption under a workload condition. From experimental results, Bamp can provide comprehensive analysis overhead per user data written in a NAND Flash-based device in comparison to write amplification. In addition, using Bamp, we can apply a right NAND Flash-based device in embedded systems.
Sun Hui, Xieyun Fang, Changsheng Xie 0001, Fei Wu 0005
DASC2