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

Herbert Kuss

dblp:38/6101 · also Herbert Kuß · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1982
—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 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
distributed commit protocols
0.011982
On Totally Ordering Checkpoints in Distributed Data Bases · SIGMOD Conference 1982
Transaction processing and concurrency control
distributed transaction management
0.011982
On Totally Ordering Checkpoints in Distributed Data Bases · SIGMOD Conference 1982
Distributed systems
fault tolerance
0.011982
On Totally Ordering Checkpoints in Distributed Data Bases · SIGMOD Conference 1982

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

two-phase commit · 0.0checkpoint ordering · 0.0
YearPublicationVenuePosition
1982 On Totally Ordering Checkpoints in Distributed Data Bases
abstract
Two-phase commit techniques to achieve atomicity of transactions in distributed database systems have been widely presented in the past. Less attention in comparison with this technique has been payed to the problem of "cold restart". To this problem we present a solution which has as its main properties:- low communication overhead and only partial cooperation between transaction managers during normal operation of the distributed system are required when making provisions to cope with cold restart,- a globally uniform total order of local checkpoints is continuously constructed and always present, thus speeding up situations of cold restart,- certain nodes of the network have an a priori chance to decide, whether they need to be restarted and in some cases may be relieved from parsing their logs during restart.This all together leads to a solution for the problem of cold restart which essentially differs from so far presented approaches.
Herbert Kuss
SIGMOD Conference1