Cecil T. Hua

dblp:70/3270 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1983
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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
2 papers
Transaction processing and concurrency control · 100%
Theoretical computer science
1 paper
Distributed computing theory · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › concurrency control
distributed concurrency control
0.011983
A Causal Model for Analyzing Distributed Concurrency Control Algorithms · IEEE Trans. Software Eng. 1983
Transaction processing and concurrency control
serializability
0.011983
A Causal Model for Analyzing Distributed Concurrency Control Algorithms · IEEE Trans. Software Eng. 1983
Distributed systems › distributed coordination
event ordering
0.011983
Analysis of the Majority Consensus Concurrency Control Algorithm for Correctness and Performance Using the Event Ordering Approach · INFOCOM 1983

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

performance analysis · 0.0event ordering approach · 0.0history-based correctness analysis · 0.0event order model · 0.0
YearPublicationVenuePosition
1983 Analysis of the Majority Consensus Concurrency Control Algorithm for Correctness and Performance Using the Event Ordering Approach
Cecil T. Hua, Bharat K. Bhargava
INFOCOM1
1983 A Causal Model for Analyzing Distributed Concurrency Control Algorithms
abstract
An event order based model for specifying and analyzing concurrency control algorithms for distributed database systems has been presented. An expanded notion of history that includes the database access events as well as synchronization events is used to study the correctness, degree of concurrency, and other aspects of the algorithms such as deadlocks and reliability. The algorithms are mapped into serializable classes that have been defined based on the order of synchronization events such as lock points, commit point, arrival of a transaction, etc,.
Bharat K. Bhargava, Cecil T. Hua
IEEE Trans. Software Eng.2
1982 Classes of Serializable Histories and Synchronization Algorithms in Distributed Database Systems
Cecil T. Hua, Bharat K. Bhargava
ICDCS1