3 papers
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…
cs.AI2020
DJEnsemble: On the Selection of a Disjoint Ensemble of Deep Learning Black-Box Spatio-Temporal Models
Yania Molina Souto, Rafael Pereira, Rocío Zorrilla +6
In this paper, we present a cost-based approach for the automatic selection and allocation of a disjoint ensemble of black-box predictors to answer predictive spatio-temporal queri…