Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel Myers
dblp:48/9634
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3
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
2 papers |
Cloud and datacenter computing · 52% Distributed systems · 48% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing
cluster resource management and scheduling |
0.2 | 1 | 2016 | Slicer: Auto-Sharding for Datacenter Applications · OSDI 2016 |
Cloud and datacenter computing
cloud infrastructure |
0.1 | 1 | 2011 | Thialfi: a client notification service for internet-scale applications · SOSP 2011 |
Distributed systems › publish/subscribe systems
event notification service |
0.1 | 1 | 2011 | Thialfi: a client notification service for internet-scale applications · SOSP 2011 |
Distributed systems
replication |
0.1 | 2 | 2016 | Slicer: Auto-Sharding for Datacenter Applications · OSDI 2016 Thialfi: a client notification service for internet-scale applications · SOSP 2011 |
Distributed systems › distributed database
sharding |
0.1 | 1 | 2016 | Slicer: Auto-Sharding for Datacenter Applications · OSDI 2016 |
Distributed systems › replication › replica control
asynchronous replication |
0.0 | 1 | 2011 | Thialfi: a client notification service for internet-scale applications · SOSP 2011 |
Methods — techniques the papers use, named apart from their topics
soft-state recovery · 0.1client-driven replication · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Fast key-value stores: An idea whose time has come and goneabstractRemote, in-memory key-value (RINK) stores such as Memcached [6] and Redis [7] are widely used in industry and are an active area of academic research. Coupled with stateless application servers to execute business logic and a databaselike system to provide persistent storage, they form a core component of popular data center service architectures. We argue that the time of the RINK store has come and gone: their domain-independent APIs (e.g., PUT/GET) push complexity back to the application, leading to extra (un)marshalling overheads and network hops. Instead, data center services should be built using stateful application servers or custom in-memory stores with domain-specific APIs, which offer higher performance than RINKS at lower cost. Such designs have been avoided because they are challenging to implement without appropriate infrastructure support. Given recent advances in auto-sharding [8, 9], we argue it is time to revisit these decisions. In this paper, we evaluate the potential performance improvements of stateful designs, propose a new abstraction, the linked, in-memory key-value (LINK) store, to enable developers to easily implement stateful services, and discuss areas for future research. Atul Adya, Robert Grandl, Daniel Myers, Henry Qin |
HotOS | 3 |
| 2016 | Slicer: Auto-Sharding for Datacenter Applications
Atul Adya, Daniel Myers, Jon Howell, Jeremy Elson, Colin Meek, Vishesh Khemani, Stefan Fulger, Pan Gu, Lakshminath Bhuvanagiri, Jason Hunter, Roberto Peon, Larry Kai, Alexander Shraer, Arif Merchant, Kfir Lev-Ari |
OSDI | 2 |
| 2011 | Thialfi: a client notification service for internet-scale applicationsabstractEnsuring the freshness of client data is a fundamental problem for applications that rely on cloud infrastructure to store data and mediate sharing. Thialfi is a notification service developed at Google to simplify this task. Thialfi supports applications written in multiple programming languages and running on multiple platforms, e.g., browsers, phones, and desktops. Applications register their interest in a set of shared objects and receive notifications when those objects change. Thialfi servers run in multiple Google data centers for availability and replicate their state asynchronously. Thialfi's approach to recovery emphasizes simplicity: all server state is soft, and clients drive recovery and assist in replication. A principal goal of our design is to provide a straightforward API and good semantics despite a variety of failures, including server crashes, communication failures, storage unavailability, and data center failures. Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek |
SOSP | 3 |