Demo Data from EDBT 2026 / reviewers in the wild / expert
Jodi Spacek
dblp:344/3555
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, 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.
| Databases, data mining, and information retrieval
1 paper |
Data stream processing · 77% Query processing and optimization · 23% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
0.8 | 1 | 2024 | Differentially Private Stream Processing at Scale · Proc. VLDB Endow. 2024 |
Query processing and optimization › SQL query processing
SQL query engine |
0.2 | 1 | 2024 | Differentially Private Stream Processing at Scale · Proc. VLDB Endow. 2024 |
Methods — techniques the papers use, named apart from their topics
preemptive execution · 1.5key selection algorithm · 1.5differential privacy · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Differentially Private Stream Processing at ScaleabstractWe design, to the best of our knowledge, the first differentially private (DP) stream aggregation processing system at scale. Our system - Differential Privacy SQL Pipelines (DP-SQLP) - is built using a streaming framework similar to Spark streaming, and is built on top of the Spanner database and the F1 query engine from Google. Towards designing DP-SQLP we make both algorithmic and systemic advances, namely, we (i) design a novel (user-level) DP key selection algorithm that can operate on an unbounded set of possible keys, and can scale to one billion keys that users have contributed, (ii) design a preemptive execution scheme for DP key selection that avoids enumerating all the keys at each triggering time, and (iii) use algorithmic techniques from DP continual observation to release a continual DP histogram of user contributions to different keys over the stream length. We empirically demonstrate the efficacy by obtaining at least 16× reduction in error over meaningful baselines we consider. We implemented a streaming differentially private user impressions for Google Shopping with DP-SQLP. The streaming DP algorithms are further applied to Google Trends. Vadym Doroshenko, Peter Kairouz, Thomas Steinke 0002, Abhradeep Thakurta, Ziyin Ma, Eidan Cohen, Himani Apte, Jodi Spacek |
Proc. VLDB Endow. | 9 |