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

Rony Attar

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

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

Software engineering, systems software and programming languages · 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%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
backup and recovery
0.011984
Site Initialization, Recovery, and Backup in a Distributed Database System · IEEE Trans. Software Eng. 1984
Transaction processing and concurrency control › concurrency control
serializable concurrency control
0.011984
Site Initialization, Recovery, and Backup in a Distributed Database System · IEEE Trans. Software Eng. 1984

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

distributed algorithm · 0.0
YearPublicationVenuePosition
1984 Site Initialization, Recovery, and Backup in a Distributed Database System
abstract
Site initialization is the problem of integrating a new site into a running distributed database system (DDBS). Site recovery is the problem of integrating an old site into a DDBS when the site recovers from failure. Site backup is the problem of creating a static backup copy of a database for archival or query purposes. We present an algorithm that solves the site initialization problem. By modifying the algorithm slightly, we get solutions to the other two problems as well. Our algorithm exploits the fact that a correct DDBS must run a serializable concurrency control algorithm. Our algorithm relies on the concurrency control algorithm to handle all intersite synchronization.
Rony Attar, Philip A. Bernstein, Nathan Goodman
IEEE Trans. Software Eng.1