157 citations · 250 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DB2019
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
Kaleb Alway, Eric Blais, Semih Salihoglu
Recent beyond worst-case optimal join algorithms Minesweeper and its generalization Tetris have brought the theory of indexing and join processing together by developing a geometri…
cs.DB2019
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins
Amine Mhedhbi, Semih Salihoglu
We study the problem of optimizing subgraph queries using the new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time us…