Supported by NSF Career Award IIS-1762268 and NSF Award IIS-1956096
SIGMOD 2024 paper received Honorable Mention
EDBT 2021 paper awarded Best Paper
Papers at PODS 2021, SIGMOD 2017, VLDB 2015, and WALCOM 2017 selected as 'Best of Conference'
Two SIGMOD 2020 papers received Reproducibility Awards
Background
Works on the theory of scalable data management
Aims to extend modern data management systems to support novel functionalities such as provenance, trust, explanations, and uncertain or inconsistent data
Studies fundamental algebraic properties that enable algorithms to scale with data size by leveraging data structure
For computationally hard queries, proposes 'algebraic cheating'—modifying objectives to preserve original intent while enabling desirable algebraic properties
Approaches leveraging these properties achieve significant speed-ups with less training data