Demo Data from EDBT 2026 / reviewers in the wild / expert
George Diehr
dblp:17/6901
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 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 |
Storage systems · 50% Performance modeling and evaluation · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation
analytical modeling |
0.0 | 1 | 1994 | Estimating Block Accesses in Database Organizations · IEEE Trans. Knowl. Data Eng. 1994 |
Storage systems › i/o architecture › i/o subsystem
disk access |
0.0 | 1 | 1994 | Estimating Block Accesses in Database Organizations · IEEE Trans. Knowl. Data Eng. 1994 |
Methods — techniques the papers use, named apart from their topics
upper and lower bounds · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Estimating Block Accesses in Database OrganizationsabstractThe exact expression for the expected number of disk accesses required to retrieve a given number of records, called the Yao function, requires iterative computations. Several authors have developed approximations to the Yao function, all of which have substantial errors in some situations. We derive and evaluate simple upper and lower bounds that never differ by more than a small fraction of a disk access.> George Diehr, Aditya N. Saharia |
IEEE Trans. Knowl. Data Eng. | 1 |
| 1992 | Linear-density hashing with dynamic overflow sharing
Murlidhar Koushik, George Diehr |
Inf. Syst. | 2 |