Demo Data from VLDB 2026 / reviewers in the wild / expert
Benjamin Gum
dblp:14/5427
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Theory of computation · 1
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.
| Theoretical computer science
1 paper |
Computational complexity · 60% Algorithms and data structures · 40% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
disk array |
0.0 | 1 | 2000 | Trading Capacity for Performance in a Disk Array · OSDI 2000 |
Storage systems › disk array
disk array performance |
0.0 | 1 | 2000 | Trading Capacity for Performance in a Disk Array · OSDI 2000 |
Algorithms and data structures › similarity search › nearest neighbor search
approximate nearest neighbor search |
0.0 | 1 | 1999 | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube · STOC 1999 |
Computational complexity › computational models
cell probe model |
0.0 | 1 | 1999 | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube · STOC 1999 |
Computational complexity
lower bounds |
0.0 | 1 | 1999 | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube · STOC 1999 |
Algorithms and data structures › similarity search
nearest neighbor search |
0.0 | 1 | 1999 | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube · STOC 1999 |
Computational complexity
query complexity |
0.0 | 1 | 1999 | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube · STOC 1999 |
Methods — techniques the papers use, named apart from their topics
performance modeling · 0.0communication complexity · 0.0cell probe lower bound · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Trading Capacity for Performance in a Disk Array
Benjamin Gum, Yuqun Chen, Randolph Y. Wang, Kai Li 0001, Arvind Krishnamurthy, Thomas E. Anderson |
OSDI | 2 |
| 1999 | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming CubeabstractWe consider the nearest-neighbor problem over the d-cube: given a collection of points in {0, 1} d, find the one nearest to a query point (in the L 1 sense). We establish a lower bound of Ω(log log d/log log log d)ontheworst-casequery time. This result holds in the cell probe model with (any amount of) polynomial storage and word-size d O(1). The same lower bound holds for the approximate version of the problem, where the answer may be any point further than the nearest neighbor by a factor as large as 2 ⌊(log d)1−ε ⌋ , for any fixed ε>0. 1 Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov |
STOC | 3 |