31 citations · 44 across the 3 of their papers we have counts for
4 papers
General-Purpose Join Algorithms for Listing Triangles in Large Graphs
Daniel Zinn
We investigate applying general-purpose join algorithms to the triangle listing problem in an out-of-core context. In particular, we focus on Leapfrog Triejoin (LFTJ) by Veldhuizen…
Win-Move is Coordination-Free (Sometimes)
Daniel Zinn, Todd J Green, Bertram Ludäscher
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog program and the number of "coordination stages" requi…
First-Order Provenance Games
Sven Köhler, Bertram Ludäscher, Daniel Zinn
We propose a new model of provenance, based on a game-theoretic approach to query evaluation. First, we study games G in their own right, and ask how to explain that a position x i…
Weak Forms of Monotonicity and Coordination-Freeness
Daniel Zinn
Our earlier work titled: "Win-move is Coordination-Free (Sometimes)" has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a s…