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

Nadav Keren

dblp:349/8716 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0002-1017-4736ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021

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
Memory systems · 87% Storage systems · 13%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache management		 1.012026
Latency-Aware Caching with Delayed Hits: From Bursty Traffic to Pipeline Architectures · NSDI 2026
Memory systems › cache management › storage caching
caching policy		 1.012026
Latency-Aware Caching with Delayed Hits: From Bursty Traffic to Pipeline Architectures · NSDI 2026
Storage systems
key-value storage		 0.312026
Latency-Aware Caching with Delayed Hits: From Bursty Traffic to Pipeline Architectures · NSDI 2026

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

queueing model · 1.0
YearPublicationVenuePosition
2026 Latency-Aware Caching with Delayed Hits: From Bursty Traffic to Pipeline Architectures
Nadav Keren, Gil Einziger, Gabriel Scalosub
 NSDI1
2023 On Latency Awareness with Delayed Hits
abstract
We consider a new locality pattern in the form of burstiness to improve cache effectiveness in workflows where items are requested in possibly infrequent yet costly batches. Adding a cache that handles only bursty items to existing State-Of-The-Art algorithms shows a significant improvement in overall average time per query.
Gil Einziger, Nadav Keren, Gabriel Scalosub
 SYSTOR2