Demo Data from EDBT 2026 / reviewers in the wild / expert
Anat Gafni
dblp:82/6912
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1992
—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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 91% Storage systems · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › concurrency control
distributed concurrency control |
0.0 | 1 | 1992 | A Time-based Distributed Optimistic Recovery and Concurrency Control Mechanism · ICDE 1992 |
Distributed systems › fault tolerance › failure recovery
distributed recovery |
0.0 | 1 | 1992 | A Time-based Distributed Optimistic Recovery and Concurrency Control Mechanism · ICDE 1992 |
Distributed systems › concurrency control
optimistic concurrency control |
0.0 | 1 | 1992 | A Time-based Distributed Optimistic Recovery and Concurrency Control Mechanism · ICDE 1992 |
Storage systems › file systems
versioning |
0.0 | 1 | 1992 | A Time-based Distributed Optimistic Recovery and Concurrency Control Mechanism · ICDE 1992 |
Methods — techniques the papers use, named apart from their topics
timewarp mechanism · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | A Time-based Distributed Optimistic Recovery and Concurrency Control MechanismabstractThe authors describe a time-based approach to distributed concurrency control and recovery that alleviates the high cost of optimistic methods by combining the solutions to concurrency control, recovery management, and localized control into a single flexible yet powerful and efficient mechanism. The approach adapts the object-oriented Timewarp mechanism to handle competing processes rather than the cooperating processes for which it was originally intended. The result is a completely decentralized, nonblocking concurrency and recovery protocol that supports more general features of other desirable aspects of distributed applications, such as versioning and active objects.> Anat Gafni, Kotcherlakota V. Bapa Rao |
ICDE | 1 |