77 citations · 281 across the 23 of their papers we have counts for
4 papers · 1 filter
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
Gaetano Geck, Bas Ketsman, Frank Neven +1
Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether…
Static Analysis for Logic-Based Dynamic Programs
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A dynamic program, as introduced by Patnaik and Immerman (1994), maintains the result of a fixed query for an input database which is subject to tuple insertions and deletions. It…
Reachability is in DynFO
Samir Datta, Raghav Kulkarni, Anish Mukherjee +2
Patnaik and Immerman introduced the dynamic complexity class DynFO of database queries that can be maintained by first-order dynamic programs with the help of auxiliary relations u…
Parallel-Correctness and Transferability for Conjunctive Queries
Tom J. Ameloot, Gaetano Geck, Bas Ketsman +2
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round mul…