DJEnsemble: On the Selection of a Disjoint Ensemble of Deep Learning Black-Box Spatio-temporal Models. - Yania Molina Souto; Rafael S. Pereira 001; Rocío Zorrilla; Anderson Chaves da Silva; Brian Tsan; Florin Rusu; Eduardo S. Ogasawara; Artur Ziviani; Fábio Porto 001 (CoRR, 2020)

DJEnsemble: a Cost-Based Selection and Allocation of a Disjoint Ensemble of Spatio-temporal Models. - Rafael S. Pereira 001; Yania Molina Souto; Anderson Chaves da Silva; Rocío Zorilla; Brian Tsan; Florin Rusu; Eduardo S. Ogasawara; Artur Ziviani; Fábio Porto 001 (SSDBM, 2021)

Simpli-Squared: A Very Simple Yet Unexpectedly Powerful Join Ordering Algorithm Without Cardinality Estimates. - Asoke Datta; Yesdaulet Izenov; Brian Tsan; Florin Rusu (CoRR, 2021)

Detect, Retrieve, Comprehend: A Flexible Framework for Zero-Shot Document-Level Question Answering. - Tavish McDonald; Brian Tsan; Amar Saini; Juanita Ordonez; Luis Gutierrez; Phan Nguyen; Blake Mason; Brenda Ng (SDU@AAAI, 2023)

Analyzing Query Optimizer Performance in the Presence and Absence of Cardinality Estimates. - Asoke Datta; Brian Tsan; Yesdaulet Izenov; Florin Rusu (CoRR, 2023)

Simpli-Squared: Optimizing Without Cardinality Estimates. - Asoke Datta; Brian Tsan; Yesdaulet Izenov; Florin Rusu (SiMoD@SIGMOD, 2024)

Spanning Tree-based Query Plan Enumeration. - Yesdaulet Izenov; Asoke Datta; Brian Tsan; Abylay Amanbayev; Florin Rusu (CoRR, 2024)

Sub-optimal Join Order Identification with L1-error. - Yesdaulet Izenov; Asoke Datta; Brian Tsan; Florin Rusu (Proc. ACM Manag. Data, 2024)

Approximate Sketches. - Brian Tsan; Asoke Datta; Yesdaulet Izenov; Florin Rusu (Proc. ACM Manag. Data, 2024)

PLANSIEVE: Real-time Suboptimal Query Plan Detection Through Incremental Refinements. - Asoke Datta; Yesdaulet Izenov; Brian Tsan; Abylay Amanbayev; Florin Rusu (CoRR, 2025)

Sketched Sum-Product Networks for Joins. - Brian Tsan; Abylay Amanbayev; Asoke Datta; Florin Rusu (CoRR, 2025)