Worst-Case Optimal Graph Joins in Almost No Space.
Diego ArroyueloAidan HoganGonzalo NavarroJuan L. ReutterJaviel Rojas-LedesmaAdrián SotoPublished in: SIGMOD Conference (2021)
Keyphrases
- worst case
- lower bound
- constant factor
- average case
- graph representation
- greedy algorithm
- error bounds
- optimal solution
- equivalence classes
- directed graph
- nearest neighbor graph
- worst case analysis
- running times
- graph model
- bipartite graph
- approximation algorithms
- query optimization
- upper bound
- np hard
- search space
- space time
- graph structure
- random walk
- join algorithms
- low dimensional
- dynamic programming
- computational complexity
- query evaluation
- high dimensional
- solution path
- spectral decomposition