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
Demo Data from EDBT 2026 / reviewers in the wild / expert

F. Bukhari

dblp:04/3751 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—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%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › concurrency control
distributed concurrency control		 0.011993
Two Fully Distributed Concurrency Control Algorithms · IEEE Trans. Knowl. Data Eng. 1993
Transaction processing and concurrency control › concurrency control › distributed concurrency control
replicated database concurrency control		 0.011993
Two Fully Distributed Concurrency Control Algorithms · IEEE Trans. Knowl. Data Eng. 1993

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

two-phase locking · 0.0timestamp ordering · 0.0
YearPublicationVenuePosition
1993 Two Fully Distributed Concurrency Control Algorithms
abstract
Two new concurrency control algorithms are introduced for partially replicated distributed databases. They both maintain two values of a data item, and differ in that one requires all locks to be granted at one time, whereas the other does not. They are based on locking, and avoid deadlocks by using timestamps to establish an execution order when conflicts arise. Since they both proceed without any communication among schedulers, but only communication between the originating site and all participating sites, we say they are fully distributed.>
F. Bukhari, Sylvia L. Osborn
 IEEE Trans. Knowl. Data Eng.1