EDBT 2026 Demo / reviewers in the wild / expert
Yuri Dolgov
dblp:69/5834
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1 · 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 |
Distributed systems · 44% Cloud and datacenter computing · 44% Storage systems · 13% | |
| Software engineering, system software, and programming languages
1 paper |
Concurrent programming · 50% Runtime systems and virtual machines · 50% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
data placement |
0.3 | 1 | 2025 | Scribe: How Meta transports zettabytes per day in real time · Proc. VLDB Endow. 2025 |
Runtime systems and virtual machines › managed runtime
java runtime |
0.1 | 1 | 2008 | Practical experiences with Java software transactional memory · PPoPP 2008 |
Concurrent programming › transactional memory
software transactional memory |
0.1 | 1 | 2008 | Practical experiences with Java software transactional memory · PPoPP 2008 |
Methods — techniques the papers use, named apart from their topics
opportunistic data placement · 0.9multi-hop write path · 0.9adaptive replica placement · 0.9software transactional memory · 0.1lock-based synchronization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Scribe: How Meta transports zettabytes per day in real timeabstractMillions of web servers and a multitude of applications are producing ever-increasing amounts of data in real time at Meta. Regardless of how data is generated and how it is processed, there is a need for infrastructure that can accommodate the transport of arbitrarily large data streams from their generation location to their processing location with low latency. This paper presents Scribe, a multi-tenant message queue service that natively supports the requirements of Meta's data-intensive applications, ingesting > 15 TB/s and serving > 110 TB/s to its consumers. Scribe relies on a multi-hop write path and opportunistic data placement to maximise write availability, whereas its read path adapts replica placement and representation based on the incoming workload as a means to minimise resource consumption for both Scribe and its downstreams. The wide range of Scribe use cases can pick from a range of offered guarantees, based on the trade-offs favourable for each one. Manos Karpathiotakis, Vlassios Rizopoulos, Artem Gelun, Tiziano Carotti, Hazem Nada, Basri Kahveci, Yuri Dolgov |
Proc. VLDB Endow. | 7 |
| 2008 | Practical experiences with Java software transactional memoryabstractIn this paper, we evaluate the emerging Transactional Memory (TM) area by developing a set of Java transactional memory workloads and studying their performance under a Java Software Transactional Memory (STM) system and comparing them to their lock based counterparts. We provide a detailed performance and memory consumption analysis of the overheads of software transactional memory and transactional workloads within a production quality open source Java Runtime system. Additionally, we detail the impact of the various performance optimizations in both workloads and the underlying runtime system to improving both single thread performance and scalability. Evgueni Brevnov, Yuri Dolgov, Boris Kuznetsov, Dmitry Yershov, Vyacheslav Shakin, Dong-yuan Chen, Vijay Menon 0002, Suresh Srinivas |
PPoPP | 2 |