activity
20132022
most citedSquish: Near-Optimal Compression for Archival of Relational Datasets

17 citations · 45 across the 8 of their papers we have counts for

collaborators

9 papers

cs.DB2022★ 12 cited

Efficient Query Re-optimization with Judicious Subquery Selections

Junyi Zhao, Huanchen Zhang, Yihan Gao

Query re-optimization is an adaptive query processing technique that re-invokes the optimizer at certain points in query execution. The goal is to dynamically correct the cardinali…

cs.DB2021★ 2 cited

CARMI: A Cache-Aware Learned Index with a Cost-based Construction Algorithm

Jiaoyi Zhang, Yihan Gao

Learned indexes, which use machine learning models to replace traditional index structures, have shown promising results in recent studies. However, existing learned indexes exhibi…

cs.LG2018★ 2 cited

The Importance of Norm Regularization in Linear Graph Embedding: Theoretical Analysis and Empirical Demonstration

Yihan Gao, Chao Zhang, Jian Peng +1

Learning distributed representations for nodes in graphs is a crucial primitive in network analysis with a wide spectrum of applications. Linear graph embedding methods learn such…

cs.DB2017★ 3 cited

Navigating the Data Lake with Datamaran: Automatically Extracting Structure from Log Datasets

Yihan Gao, Silu Huang, Aditya Parameswaran

Organizations routinely accumulate semi-structured log datasets generated as the output of code; these datasets remain unused and uninterpreted, and occupy wasted space - this phen…

cs.DB2016★ 17 cited

Squish: Near-Optimal Compression for Archival of Relational Datasets

Yihan Gao, Aditya Parameswaran

Relational datasets are being generated at an alarmingly rapid rate across organizations and industries. Compressing these datasets could significantly reduce storage and archival…

cs.LG2015

On the Interpretability of Conditional Probability Estimates in the Agnostic Setting

Yihan Gao, Aditya Parameswaran, Jian Peng

We study the interpretability of conditional probability estimates for binary classification under the agnostic setting or scenario. Under the agnostic setting, conditional probabi…

cs.CC2014

Tighter Relations Between Sensitivity and Other Complexity Measures

Andris Ambainis, Mohammad Bavarian, Yihan Gao +3

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulate…

cs.GT2014★ 8 cited

Finish Them!: Pricing Algorithms for Human Computation

Yihan Gao, Aditya Parameswaran

Given a batch of human computation tasks, a commonly ignored aspect is how the price (i.e., the reward paid to human workers) of these tasks must be set or varied in order to meet…

cs.CC2013★ 1 cited

New upper bound on block sensitivity and certificate complexity in terms of sensitivity

Andris Ambainis, Yihan Gao, Jieming Mao +2

Sensitivity \cite{CD82,CDR86} and block sensitivity \cite{Nisan91} are two important complexity measures of Boolean functions. A longstanding open problem in decision tree complexi…