29 citations · 73 across the 14 of their papers we have counts for
18 papers
The Complexity of Finding Missing Answer Repairs
Jesse Comer, Val Tannen
We investigate the problem of identifying database repairs for missing tuples in query answers. We show that when the query is part of the input - the combined complexity setting -…
A Unifying Algorithm for Hierarchical Queries
Mahmoud Abo Khamis, Jesse Comer, Phokion Kolaitis +2
The class of hierarchical queries is known to define the boundary of the dichotomy between tractability and intractability for the following two extensively studied problems about…
Provenance Analysis and Semiring Semantics for First-Order Logic
Erich Grädel, Val Tannen
A provenance analysis for a query evaluation or a model checking computation extracts information on how its result depends on the atomic facts of the model or database. Traditiona…
Evaluating Datalog over Semirings: A Grounding-based Approach
Hangdong Zhao, Shaleen Deep, Paraschos Koutris +2
Datalog is a powerful yet elegant language that allows expressing recursive computation. Although Datalog evaluation has been extensively studied in the literature, so far, only lo…
Syntax Monads for the Working Formal Metatheorist
Lawrence Dunn, Val Tannen, Steve Zdancewic
Formally verifying the properties of formal systems using a proof assistant requires justifying numerous minor lemmas about capture-avoiding substitution. Despite work on category-…
DBSP: Automatic Incremental View Maintenance for Rich Query Languages
Mihai Budiu, Frank McSherry, Leonid Ryzhyk +1
Incremental view maintenance has been for a long time a central problem in database theory. Many solutions have been proposed for restricted classes of database languages, such as…