Showing cs.DBShow all
2 papers · 1 filter
cs.DB2024
A Simple Algorithm for Worst-Case Optimal Join and Sampling
Florent Capelli, Oliver Irwin, Sylvain Salvati
We present an elementary branch and bound algorithm with a simple analysis of why it achieves worstcase optimality for join queries on classes of databases defined respectively by…
cs.DB2023
Direct Access for Conjunctive Queries with Negations
Florent Capelli, Nofar Carmeli, Oliver Irwin +1
Given a conjunctive query and a database , a direct access to the answers of over is the operation of returning, given an index , the -th answer for some order…