4 papers
K-Join: Combining Vertex Covers for Parallel Joins
Simon Frisk, Austen Fan, Paraschos Koutris
Significant research effort has been devoted to improving the performance of join processing in the massively parallel computation model, where the goal is to evaluate a query with…
New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
Austen Fan, Jin-Yi Cai, Shuai Shao +1
We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in for the eight-vertex model, the partition func…
Circuits and Formulas for Datalog over Semirings
Austen Z. Fan, Paraschos Koutris, Sudeepa Roy
In this paper, we study circuits and formulas for provenance polynomials of Datalog programs. We ask the following question: given an absorptive semiring and a fact of a Datalog pr…
Output-sensitive Conjunctive Query Evaluation
Shaleen Deep, Hangdong Zhao, Austen Z. Fan +1
Join evaluation is one of the most fundamental operations performed by database systems and arguably the most well-studied problem in the Database community. A staggering number of…