11 citations · 13 across the 16 of their papers we have counts for
9 papers · 1 filter
Compositional Online Learning for Semantic Data Processing Systems
Paweł Liskowski, Fuheng Zhao, Benjamin Han +2
An LLM call in a semantic data processing system is expensive enough to dominate query cost, yet slow enough to hide a CPU-side learner's update behind its round-trip. In productio…
Larch: Learned Query Optimization for Semantic Predicates
Fuheng Zhao, Pawel Liskowski, Zihan Li +5
With the advent of Large Language Models (LLMs), many database systems introduced semantic operators that enabled analytical queries over unstructured data (e.g. text, images, vide…
AvalancheBench: Evaluating Enterprise Data Agents Through Latent World Recovery
Darek Kleczek, Fuheng Zhao, Alexander W. Lee +4
We introduce AvalancheBench, a benchmark for evaluating enterprise data agents through \emph{latent world recovery}. AvalancheBench improves on existing benchmarks in three ways. F…
Access Paths for Efficient Ordering with Large Language Models
Fuheng Zhao, Jiayue Chen, Yiming Pan +7
In this work, we present the \texttt{LLM ORDER BY} semantic operator as a logical abstraction and conduct a systematic study of its physical implementations. First, we propose seve…
Hybrid Querying Over Relational Databases and Large Language Models
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi
Database queries traditionally operate under the closed-world assumption, providing no answers to questions that require information beyond the data stored in the database. Hybrid…
LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?
Fuheng Zhao, Jiayue Chen, Lawrence Lim +3
Judging the equivalence between two SQL queries is a fundamental problem with many practical applications in data management and SQL generation (i.e., evaluating the quality of gen…
The SpaceSaving Family of Algorithms for Data Streams with Bounded Deletions
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi +3
In this paper, we present an advanced analysis of near optimal algorithms that use limited space to solve the frequency estimation, heavy hitters, frequent items, and top-k approxi…
Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
Fuheng Zhao, Zach Miller, Leron Reznikov +2
The Log Structured Merge Trees (LSM-tree) based key-value stores are widely used in many storage systems to support a variety of operations such as updates, point reads, and range…
SpaceSaving: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi +1
In this paper, we propose the first deterministic algorithms to solve the frequency estimation and frequent item problems in the bounded deletion model. We establish the space lowe…