Demo Data from EDBT 2026 / reviewers in the wild / expert
Richard A. Floyd
dblp:90/6850
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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 |
Storage systems · 81% Performance modeling and evaluation · 19% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
file systems |
0.0 | 1 | 1989 | Directory Reference Patterns in Hierarchical File Systems · IEEE Trans. Knowl. Data Eng. 1989 |
Storage systems › i/o workload characterization
file system traces |
0.0 | 1 | 1989 | Directory Reference Patterns in Hierarchical File Systems · IEEE Trans. Knowl. Data Eng. 1989 |
Performance modeling and evaluation
workload characterization |
0.0 | 1 | 1989 | Directory Reference Patterns in Hierarchical File Systems · IEEE Trans. Knowl. Data Eng. 1989 |
Methods — techniques the papers use, named apart from their topics
trace analysis · 0.0cache simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Directory Reference Patterns in Hierarchical File SystemsabstractThe authors present a brief description of data on directory reference patterns collected from a 4.2BSD UNIX system. These data are used to examine the importance of the name lookup overhead involved in opening and using files. The analysis shows that paths in the environment are relatively long and that, in the absence of caching, name resolution overhead accounts for over 70% of the disk blocks referenced to open and use files. These results confirm recent conjectures on the high level of directory activity in UNIX file systems. Directory references exhibit strong locality, though, making caches an effective way to decrease directory overhead. Simulations of a least recently used (IRU) whole directory cache show that a cache holding just ten nodes achieves an 85% hit ratio. The implications of these results on the design of both local and distributed file systems are discussed.> Richard A. Floyd, Carla Schlatter Ellis |
IEEE Trans. Knowl. Data Eng. | 1 |