Demo Data from EDBT 2026 / reviewers in the wild / expert
Emily Andrews
dblp:141/4383
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 67% Storage systems · 33% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › distributed object systems
distributed garbage collection |
0.2 | 1 | 2014 | Edelweiss: Automatic Storage Reclamation for Distributed Programming · Proc. VLDB Endow. 2014 |
Distributed systems
distributed programming |
0.2 | 1 | 2014 | Edelweiss: Automatic Storage Reclamation for Distributed Programming · Proc. VLDB Endow. 2014 |
Storage systems › storage management
storage reclamation |
0.2 | 1 | 2014 | Edelweiss: Automatic Storage Reclamation for Distributed Programming · Proc. VLDB Endow. 2014 |
Programming languages and type systems
domain-specific languages |
0.1 | 1 | 2014 | Edelweiss: Automatic Storage Reclamation for Distributed Programming · Proc. VLDB Endow. 2014 |
Methods — techniques the papers use, named apart from their topics
program analysis · 0.4code generation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Edelweiss: Automatic Storage Reclamation for Distributed ProgrammingabstractEvent Log Exchange (ELE) is a common programming pattern based on immutable state and messaging. ELE sidesteps traditional challenges in distributed consistency, at the expense of introducing new challenges in designing space reclamation protocols to avoid consuming unbounded storage. We introduce Edelweiss , a sublanguage of Bloom that provides an ELE programming model, yet automatically reclaims space without programmer assistance. We describe techniques to analyze Edelweiss programs and automatically generate application-specific distributed space reclamation logic. We show how Edelweiss can be used to elegantly implement a variety of communication and distributed storage protocols; the storage reclamation code generated by Edelweiss effectively garbage-collects state and often matches hand-written protocols from the literature. Neil Conway, Peter Alvaro, Emily Andrews, Joseph M. Hellerstein |
Proc. VLDB Endow. | 3 |