Hangdong Zhao - RankMe

24 papers A* 2A 3Journal 18Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. ACM Trans. Database Syst. Hangdong Zhao, Austen Z. Fan, Xiating Ouyang, Paraschos Koutris
2026	A	`conf`	I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server. CIDR Hangdong Zhao, Yuanyuan Tian, Rana Alotaibi, Bailu Ding, Nicolas Bruno, Jesús Camacho-Rodríguez, Vassilis Papadimos, Ernesto Cervantes Juárez, César A. Galindo-Legaria, Carlo Curino
2026	J	`jnl`	xBound: Join Size Lower Bounds. CoRR Mihail Stoian, Tiemo Bang, Hangdong Zhao, Jesús Camacho-Rodríguez, Yuanyuan Tian, Andreas Kipf
2025	J	`jnl`	Circuit Bounds for Conjunctive Queries with Self-joins. Proc. ACM Manag. Data Austen Z. Fan, Paraschos Koutris, Hangdong Zhao
2025	J	`jnl`	FlowLog: Efficient and Extensible Datalog via Incrementality. CoRR Hangdong Zhao, Zhenghong Yu, Srinag Rao, Simon Frisk, Zhiwei Fan, Paraschos Koutris
2025	J	`jnl`	FlowLog: Efficient and Extensible Datalog via Incrementality. Proc. VLDB Endow. Hangdong Zhao, Zhenghong Yu, Srinag Rao, Simon Frisk, Zhiwei Fan, Paraschos Koutris
2025	J	`jnl`	One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans. CoRR Yujun He, Hangdong Zhao, Simon Frisk, Yifei Yang, Kevin Kristensen, Paraschos Koutris, Xiangyao Yu
2025	J	`jnl`	Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. ACM Trans. Database Syst. Hangdong Zhao, Shaleen Deep, Paraschos Koutris
2025	A	`conf`	The Quest for Faster Join Algorithms (Invited Talk). ICDT Paraschos Koutris, Shaleen Deep, Austen Z. Fan, Hangdong Zhao
2024	J	`jnl`	Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. Proc. ACM Manag. Data Hangdong Zhao, Austen Z. Fan, Xiating Ouyang, Paraschos Koutris
2024	J	`jnl`	Evaluating Datalog over Semirings: A Grounding-based Approach. CoRR Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen
2024	J	`jnl`	Evaluating Datalog over Semirings: A Grounding-based Approach. Proc. ACM Manag. Data Hangdong Zhao, Shaleen Deep, Paraschos Koutris, Sudeepa Roy, Val Tannen
2024	—	`conf`	Evaluating Datalog via Structure-Aware Rewriting. Datalog Hangdong Zhao, Paraschos Koutris, Shaleen Deep
2024	J	`jnl`	Output-sensitive Conjunctive Query Evaluation. CoRR Shaleen Deep, Hangdong Zhao, Austen Z. Fan, Paraschos Koutris
2024	J	`jnl`	Output-sensitive Conjunctive Query Evaluation. Proc. ACM Manag. Data Shaleen Deep, Hangdong Zhao, Austen Z. Fan, Paraschos Koutris
2024	A	`conf`	Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries. CIDR Yifei Yang, Hangdong Zhao, Xiangyao Yu, Paraschos Koutris
2024	J	`jnl`	Tight Bounds of Circuits for Sum-Product Queries. Proc. ACM Manag. Data Austen Z. Fan, Paraschos Koutris, Hangdong Zhao
2023	J	`jnl`	Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization. CoRR Hangdong Zhao, Austen Z. Fan, Xiating Ouyang, Paraschos Koutris
2023	J	`jnl`	Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries. CoRR Yifei Yang, Hangdong Zhao, Xiangyao Yu, Paraschos Koutris
2023	A*	`conf`	Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. PODS Hangdong Zhao, Shaleen Deep, Paraschos Koutris
2023	J	`jnl`	Space-Time Tradeoffs for Conjunctive Queries with Access Patterns. CoRR Hangdong Zhao, Shaleen Deep, Paraschos Koutris
2023	A*	`conf`	The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. ICALP Austen Z. Fan, Paraschos Koutris, Hangdong Zhao
2023	J	`jnl`	The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. CoRR Austen Z. Fan, Paraschos Koutris, Hangdong Zhao
2021	J	`jnl`	On Architecture Selection for Linear Inverse Problems with Untrained Neural Networks. Entropy Yang Sun, Hangdong Zhao, Jonathan Scarlett