6 papers
Optimal Convergence of Iterative Methods for Datalogo
Simon Frisk, Sungjin Im, Paraschos Koutris +4
has been introduced as an extension to Datalog that increases expressiveness, yet retains simple least fixpoint semantics and admits optimization technique…
Conjunctive Queries with Negation: Beyond Signed-Acyclicity
Simon Frisk, Paraschos Koutris
We study constant-delay enumeration for conjunctive queries with negation (). It is known that queries can be enumerated with constant…
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…
FlowLog: Efficient and Extensible Datalog via Incrementality
Hangdong Zhao, Zhenghong Yu, Srinag Rao +3
Datalog-based languages are regaining popularity as a powerful abstraction for expressing recursive computations in domains such as program analysis and graph processing. However,…
One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans
Yujun He, Hangdong Zhao, Simon Frisk +4
Minimizing intermediate results is critical for efficient multi-join query processing. Although the seminal Yannakakis algorithm offers strong guarantees for acyclic queries, cycli…
Parallel Query Processing with Heterogeneous Machines
Simon Frisk, Paraschos Koutris
We study the problem of computing a full Conjunctive Query in parallel using heterogeneous machines. Our computational model is similar to the MPC model, but each machine has i…