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

Bruce Leban

dblp:29/2176 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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
Storage systems · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › data caching
database caching		 0.011987
Finer Grained Concurrency for the Database Cache · ICDE 1987
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning		 0.011986
A Representation for Collections of Temporal Intervals · AAAI 1986
Logic in computer science
temporal logic		 0.011986
A Representation for Collections of Temporal Intervals · AAAI 1986

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

two-phase locking · 0.0
YearPublicationVenuePosition
1987 Finer Grained Concurrency for the Database Cache
abstract
The database cache transaction recovery technique as proposed in [Elhard and Bayer 84] offers significant performance advantages for reliable database systems. However, the smallest granularity of locks it provides is the page. Here we present two schemes supporting smaller granularity. The first scheme allows maximal concurrency consistent with physical two-phase locking, with the same per-transaction I/O cost as original database cache scheme. The second scheme offers the same concurrency as the first, but features reduced I/O on commit, at the cost of some increase recovery time.
J. Eliot B. Moss, Bruce Leban, Panos K. Chrysanthis
 ICDE2
1986 A Representation for Collections of Temporal Intervals
Bruce Leban, David McDonald, David Forster
 AAAI1