6 citations · 9 across the 7 of their papers we have counts for
8 papers · 1 filter
FlowLog: Efficient and Extensible Datalog via Incrementality
Hangdong Zhao, Zhenghong Yu, Srinag Rao +3
Datalog-based languages are regaining popularity as a powerful abstraction for expressing recursive computations in domains such as program analysis and graph processing. However,…
One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans
Yujun He, Hangdong Zhao, Simon Frisk +4
Minimizing intermediate results is critical for efficient multi-join query processing. Although the seminal Yannakakis algorithm offers strong guarantees for acyclic queries, cycli…
Output-sensitive Conjunctive Query Evaluation
Shaleen Deep, Hangdong Zhao, Austen Z. Fan +1
Join evaluation is one of the most fundamental operations performed by database systems and arguably the most well-studied problem in the Database community. A staggering number of…
Evaluating Datalog over Semirings: A Grounding-based Approach
Hangdong Zhao, Shaleen Deep, Paraschos Koutris +2
Datalog is a powerful yet elegant language that allows expressing recursive computation. Although Datalog evaluation has been extensively studied in the literature, so far, only lo…
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
Hangdong Zhao, Austen Z. Fan, Xiating Ouyang +1
In this paper, we study the complexity of evaluating Conjunctive Queries with negation (\cqneg). First, we present an algorithm with linear preprocessing time and constant delay en…
Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries
Yifei Yang, Hangdong Zhao, Xiangyao Yu +1
This paper presents predicate transfer, a novel method that optimizes join performance by pre-filtering tables to reduce the join input sizes. Predicate transfer generalizes Bloom…
The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems
Austen Z. Fan, Paraschos Koutris, Hangdong Zhao
We study the fine-grained complexity of evaluating Boolean Conjunctive Queries and their generalization to sum-of-product problems over an arbitrary semiring. For these problems, w…
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns
Hangdong Zhao, Shaleen Deep, Paraschos Koutris
In this paper, we investigate space-time tradeoffs for answering conjunctive queries with access patterns (CQAPs). The goal is to create a space-efficient data structure in an init…