Showing cs.DBShow all
3 papers · 1 filter
cs.DB2025
PLANSIEVE: Real-time Suboptimal Query Plan Detection Through Incremental Refinements
Asoke Datta, Yesdaulet Izenov, Brian Tsan +2
Cardinality estimation remains a fundamental challenge in query optimization, often resulting in sub-optimal execution plans and degraded performance. While errors in cardinality e…
cs.DB2024
Spanning Tree-based Query Plan Enumeration
Yesdaulet Izenov, Asoke Datta, Brian Tsan +2
In this work, we define the problem of finding an optimal query plan as finding spanning trees with low costs. This approach empowers the utilization of a series of spanning tree a…
cs.DB2021
Simpli-Squared: A Very Simple Yet Unexpectedly Powerful Join Ordering Algorithm Without Cardinality Estimates
Asoke Datta, Yesdaulet Izenov, Brian Tsan +1
The Join Order Benchmark (JOB) has become the de facto standard to assess the performance of relational database query optimizers due to its complexity and completeness. In order t…