Incremental Maintenance for Leapfrog Triejoin

Abstract

We present an incremental maintenance algorithm for leapfrog triejoin. The algorithm maintains rules in time proportional (modulo log factors) to the edit distance between leapfrog triejoin traces.

References in corpus (1)

• Leapfrog Triejoin: a worst-case optimal join algorithm

Cited by in corpus (2)

• Transaction Repair: Full Serializability Without Locks
• Join Processing for Graph Patterns: An Old Dog with New Tricks