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

Charles W. Dissly

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

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

Software 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
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › recovery
checkpointing
0.011975
Analytic Models for Rollback and Recovery Strategies in Data Base Systems · IEEE Trans. Software Eng. 1975
Transaction processing and concurrency control
recovery
0.011975
Analytic Models for Rollback and Recovery Strategies in Data Base Systems · IEEE Trans. Software Eng. 1975
Transaction processing and concurrency control › recovery
rollback and recovery
0.011975
Analytic Models for Rollback and Recovery Strategies in Data Base Systems · IEEE Trans. Software Eng. 1975

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

optimization · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
1975 Analytic Models for Rollback and Recovery Strategies in Data Base Systems
abstract
Rollback and recovery (RR) is a method of enchancing the reliability of file or data base systems. At certain points in time, called checkpoints, a copy of the data or files is made on tape (or other storage devices). A chronological record is kept of all transactions which modify the data stored by the system; this record is called the audit trail. When an error is detected, the copy of the files or data made at the most recent checkpoint is loaded, and all transactions on the audit trail since this check point are reprocessed in chronological sequence, thus recovering from the error. This paper presents models and techniques which aid in determining optimal times for checkpoints.
K. Mani Chandy, James C. Browne, Charles W. Dissly, Werner R. Uhrig
IEEE Trans. Software Eng.3