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

Shuning Tao

dblp:191/2594 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
—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 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 67% Storage systems · 33%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
distributed transaction processing
0.812024
PALF: Replicated Write-ahead Logging for Distributed Databases · Proc. VLDB Endow. 2024
Distributed systems
consensus
0.812024
PALF: Replicated Write-ahead Logging for Distributed Databases · Proc. VLDB Endow. 2024
Distributed systems › consensus
paxos
0.812024
PALF: Replicated Write-ahead Logging for Distributed Databases · Proc. VLDB Endow. 2024
Storage systems › logging
write-ahead logging
0.812024
PALF: Replicated Write-ahead Logging for Distributed Databases · Proc. VLDB Endow. 2024
YearPublicationVenuePosition
2024 PALF: Replicated Write-ahead Logging for Distributed Databases
abstract
Distributed databases have been widely researched and developed in recent years due to their scalability, availability, and consistency guarantees. The write-ahead logging (WAL) system is one of the most vital components in a database. It is still a non-trivial problem to design a replicated logging system as the foundation of a distributed database with the power of ACID transactions. This paper proposes PALF, a Paxos-backed Append-only Log File System, to address these challenges. The basic idea behind PALF is to co-design the logging system with the entire database for supporting database-specific functions and to abstract the functions as PALF primitives to power other distributed systems. Many database functions, including transaction processing, database restore, and physical standby databases, have been built based on PALF primitives. Evaluation shows that PALF greatly outperforms well-known implementations of consensus protocols and is fully competent for distributed database workloads. PALF has been deployed as a component of the OceanBase 4.0 database and has been made open-source along with it.
Fusheng Han, Debin Jia, Xuwang Teng, Chuanhui Yang, Huafeng Xi, Shuning Tao, Quanqing Xu
Proc. VLDB Endow.10
2016 Saliency detection via global-object-seed-guided cellular automata
abstract
Image saliency detection has attracted much attention in recent years, while several challenging problems are still unsolved, such as inaccurate saliency detection in complex scenes and suppressing salient objects near image borders. In this paper, a novel algorithm is proposed to solve these problems. Firstly, we collect background seeds from image borders by boundary information and construct a background-based saliency map via low level features. Then, a novel propagation mechanism named global-object-seed-guided Cellular Automata model is builded. Cellular Automata exploits the intrinsic relevance of similar regions through interactions with neighbors, and global object seeds reduce the difference between dissimilar adjacent regions in the whole salient object. Experimental results on public benchmark datasets demonstrate the superiority of the proposed algorithm over ten state-of-the-art saliency models.
Shuning Tao
ICIP2