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

Justus Adam

dblp:214/7076 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-4046-534XORCID · corroborated

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

Software engineering, systems software and programming languages · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

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
2 papers
Database system architecture and tuning · 54% Query processing and optimization · 46%
Network and information security
2 papers
Systems and software security · 82% Privacy and data protection · 18%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
static analysis
0.912025
Paralegal: Practical Static Analysis for Privacy Bugs · OSDI 2025
Query processing and optimization
user-defined functions
0.412020
Towards Scalable UDTFs in Noria · SIGMOD Conference 2020

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

static analysis · 1.7
YearPublicationVenuePosition
2025 Paralegal: Practical Static Analysis for Privacy Bugs
Justus Adam, Carolyn Zech, Livia Zhu, Sreshtaa Rajesh, Nathan Harbison, Mithi Jethwa, Will Crichton, Shriram Krishnamurthi, Malte Schwarzkopf
OSDI1
2023 K9db: Privacy-Compliant Storage For Web Applications By Construction
Kinan Dak Albab, Ishan Sharma, Justus Adam, Benjamin Kilimnik, Aaron R. Jeyaraj, Raj Paul, Artem Agvanian, Leonhard F. Spiegelberg, Malte Schwarzkopf
OSDI3
2020 Towards Scalable UDTFs in Noria
abstract
User Defined Functions (UDF) are an important and powerful extension point for database queries. Systems using incremental materialized views largely do not support UDFs because they cannot easily be incrementalized. In this work we design single-tuple UDF and User Defined Aggregates (UDA) interfaces for Noria, a state-of-the art dataflow system with incremental materialized views. We also add limited support for User Defined Table Functions (UDTF), by compiling them to query fragments. We show our UDTFs scale by implementing a motivational example used Friedman et al.
Justus Adam
SIGMOD Conference1
2018 Compiling for concise code and efficient I/O
abstract
Large infrastructures of Internet companies, such as Facebook and Twitter, are composed of several layers of micro-services. While this modularity provides scalability to the system, the I/O associated with each service request strongly impacts its performance. In this context, writing concise programs which execute I/O efficiently is especially challenging. In this paper, we introduce Ÿauhau, a novel compile-time solution. Ÿauhau reduces the number of I/O calls through rewrites on a simple expression language. To execute I/O concurrently, it lowers the expression language to a dataflow representation. Our approach can be used alongside an existing programming language, permitting the use of legacy code. We describe an implementation in the JVM and use it to evaluate our approach. Experiments show that Ÿauhau can significantly improve I/O, both in terms of the number of I/O calls and concurrent execution. Ÿauhau outperforms state-of-the-art approaches with similar goals.
Sebastian Ertel, Andres Goens, Justus Adam, Jerónimo Castrillón
CC3