1 citations · 2 across the 6 of their papers we have counts for
6 papers
Sketched Sum-Product Networks for Joins
Brian Tsan, Abylay Amanbayev, Asoke Datta +1
Sketches have shown high accuracy in multi-way join cardinality estimation, a critical problem in cost-based query optimization. Accurately estimating the cardinality of a join ope…
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…
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…
Analyzing Query Optimizer Performance in the Presence and Absence of Cardinality Estimates
Asoke Datta, Brian Tsan, Yesdaulet Izenov +1
Most query optimizers rely on cardinality estimates to determine optimal execution plans. While traditional databases such as PostgreSQL, Oracle, and Db2 utilize many types of syno…
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…
Online Sketch-based Query Optimization
Yesdaulet Izenov, Asoke Datta, Florin Rusu +1
Cost-based query optimization remains a critical task in relational databases even after decades of research and industrial development. Query optimizers rely on a large range of s…