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

Yuan-Ting Kao

dblp:44/4355 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Systems, architecture and hardware · 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.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 67% Database system architecture and tuning · 33%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › database system implementation
client-server database
0.012003
Two-Version Based Concurrency Control and Recovery in Real-Time Client/Server Databases · IEEE Trans. Computers 2003
Transaction processing and concurrency control › concurrency control
real-time concurrency control
0.012003
Two-Version Based Concurrency Control and Recovery in Real-Time Client/Server Databases · IEEE Trans. Computers 2003
Transaction processing and concurrency control
recovery
0.012003
Two-Version Based Concurrency Control and Recovery in Real-Time Client/Server Databases · IEEE Trans. Computers 2003

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

simulation · 0.0priority ceiling protocol · 0.0
YearPublicationVenuePosition
2003 Two-Version Based Concurrency Control and Recovery in Real-Time Client/Server Databases
abstract
While there has been a significant amount of research in real-time concurrency control, little work has been done in logging and recovery for real-time databases. This paper proposes a two-version approach which considers both real-time concurrency control and recovery. We propose a network-server-based architecture and algorithms which can not only reduce the blocking time of higher-priority transactions and improve the response time of client-side read-only transactions, but also provide a diskless runtime logging mechanism and an efficient and predictable recovery procedure. The performance of the algorithms was verified by a series of simulation experiments by comparing the algorithms with the well-known Priority Ceiling Protocol (PCP), the Read/Write PCP, the New PCP, and the 2-version two-phase locking protocol, for which we have very encouraging results. The schedulability of higher-priority transactions and the response time of client-side read-only transactions were all greatly improved.
Tei-Wei Kuo, Yuan-Ting Kao, Chin-Fu Kuo
IEEE Trans. Computers2