Haozhe Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Haozhe Zhang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Christoph Mayer
University of Zurich, Zurich, Switzerland
4 shared publications - Dan Olteanu
University of Zurich, Zurich, Switzerland
4 shared publications - Dan Suciu
University of Washington, Seattle, WA, USA
3 shared publications - Mahmoud Abo Khamis
RelationalAI, Berkeley, CA, USA
3 shared publications - Ahmet Kara
Department of Industrial Engineering, Hitit University, Çorum, Turkey
1 shared publication - Arnau Erola
Department of Computer Science, University of Oxford, UK
1 shared publication
Latest Publications
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-27
CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations
This paper introduces CorrBound , a cardinality estimator that exploits the correlations between the join columns across and within relations. The state-of-the-art estimators do not observe such correlations and can therefore yield poor estimates. By explicitly accounting for correlations, CorrBound can significantly improve the accuracy of cardinality estimation. CorrBound supports multi-join queries (acyclic or cyclic) with conjunctions of equality and range predicates and group-by clauses. Its estimate is the optimal solution of a linear program whose constraints encode data statistics and Shannon inequalities. It uses a new information inequality that captures the intra- and inter-relation correlations of join columns and uses the generalized inner product of degree vectors of join columns. This inequality also captures the ℓ p -norm inequality used by the state-of-the-art estimator LpBound. The inequality comes with a high-dimensionality challenge: managing the cardinality tensor defined by the generalized inner products of many large degree vectors. To keep the estimation time feasible, CorrBound uses two compression techniques that retain the accuracy of the inner products: sketches of degree vectors and low-rank decomposition of the cardinality tensor. We experimentally evaluate CorrBound against traditional, pessimistic, and machine learning-based estimators on the JOBlight and STATS, and subgraph matching benchmarks. Our main finding is that CorrBound can be more accurate than the state of the art while maintaining a low estimation time.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-27
Open AccessCorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations
This paper introduces CorrBound , a cardinality estimator that exploits the correlations between the join columns across and within relations. The state-of-the-art estimators do not observe such correlations and can therefore yield poor estimates. By explicitly accounting for correlations, CorrBound can significantly improve the accuracy of cardinality estimation. CorrBound supports multi-join queries (acyclic or cyclic) with conjunctions of equality and range predicates and group-by clauses. Its estimate is the optimal solution of a linear program whose constraints encode data statistics and Shannon inequalities. It uses a new information inequality that captures the intra- and inter-relation correlations of join columns and uses the generalized inner product of degree vectors of join columns. This inequality also captures the ℓ p -norm inequality used by the state-of-the-art estimator LpBound. The inequality comes with a high-dimensionality challenge: managing the cardinality tensor defined by the generalized inner products of many large degree vectors. To keep the estimation time feasible, CorrBound uses two compression techniques that retain the accuracy of the inner products: sketches of degree vectors and low-rank decomposition of the cardinality tensor. We experimentally evaluate CorrBound against traditional, pessimistic, and machine learning-based estimators on the JOBlight and STATS, and subgraph matching benchmarks. Our main finding is that CorrBound can be more accurate than the state of the art while maintaining a low estimation time.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 75-81
Reproducibility Report for ACM SIGMOD 2025 Paper: 'LpBound: Pessimistic Cardinality Estimation Using ? p -Norms of Degree Sequences'
We successfully reproduced the core findings and performance results of the paper ''LpBound: Pessimistic cardinality Estimation Using ℓp-Norms of Degree Sequences''. The paper proposed an intriguing bridge between information theory and cardinality estimation and derives tight upper bounds of the intermediate cardinalities by combining Shannon inequalities, ℓp-norms, and linear programming. The authors provided scripts to execute the experiments, the original datasets, and comprehensive, well-written documentation that allowed to reproduce of the core results.
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 75-81
Open AccessReproducibility Report for ACM SIGMOD 2025 Paper: 'LpBound: Pessimistic Cardinality Estimation Using ? p -Norms of Degree Sequences'
We successfully reproduced the core findings and performance results of the paper ''LpBound: Pessimistic cardinality Estimation Using ℓp-Norms of Degree Sequences''. The paper proposed an intriguing bridge between information theory and cardinality estimation and derives tight upper bounds of the intermediate cardinalities by combining Shannon inequalities, ℓp-norms, and linear programming. The authors provided scripts to execute the experiments, the original datasets, and comprehensive, well-written documentation that allowed to reproduce of the core results.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 187-190
L p Bound in Action: Cardinality Estimation with One-Sided Guarantees
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 187-190
Open AccessL p Bound in Action: Cardinality Estimation with One-Sided Guarantees
- Open Access
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
LpBound : Pessimistic Cardinality Estimation Using ℓ p -Norms of Degree Sequences
Cardinality estimation is the problem of estimating the size of the output of a query, without actually evaluating the query. The cardinality estimator is a critical piece of a query optimizer, and is often the main culprit when the optimizer chooses a poor plan. This paper introduces LpBound, a pessimistic cardinality estimator for multi-join queries (acyclic or cyclic) with selection predicates and group-by clauses. LpBound computes a guaranteed upper bound on the size of the query output using simple statistics on the input relations, consisting of ℓ p -norms of degree sequences. The bound is the optimal solution of a linear program whose constraints encode data statistics and Shannon inequalities. We introduce two optimizations that exploit the structure of the query in order to speed up the estimation time and make LpBound practical. We experimentally evaluate LpBound against a range of traditional, pessimistic, and machine learning-based estimators on the JOB, STATS, and subgraph matching benchmarks. Our main finding is that LpBound can be orders of magnitude more accurate than traditional estimators used in mainstream open-source and commercial database systems. Yet it has comparable low estimation time and space requirements. When injected the estimates of LpBound , Postgres derives query plans at least as good as those derived using the true cardinalities.
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-27
Open AccessLpBound : Pessimistic Cardinality Estimation Using ℓ p -Norms of Degree Sequences
Cardinality estimation is the problem of estimating the size of the output of a query, without actually evaluating the query. The cardinality estimator is a critical piece of a query optimizer, and is often the main culprit when the optimizer chooses a poor plan. This paper introduces LpBound, a pessimistic cardinality estimator for multi-join queries (acyclic or cyclic) with selection predicates and group-by clauses. LpBound computes a guaranteed upper bound on the size of the query output using simple statistics on the input relations, consisting of ℓ p -norms of degree sequences. The bound is the optimal solution of a linear program whose constraints encode data statistics and Shannon inequalities. We introduce two optimizations that exploit the structure of the query in order to speed up the estimation time and make LpBound practical. We experimentally evaluate LpBound against a range of traditional, pessimistic, and machine learning-based estimators on the JOB, STATS, and subgraph matching benchmarks. Our main finding is that LpBound can be orders of magnitude more accurate than traditional estimators used in mainstream open-source and commercial database systems. Yet it has comparable low estimation time and space requirements. When injected the estimates of LpBound , Postgres derives query plans at least as good as those derived using the true cardinalities.
- Open Access
- 28 June 2021
- Published by Association for Computing Machinery (ACM)
- p. 160-163
Machine learning over static and dynamic relational data
This tutorial overviews principles behind recent works on training and maintaining machine learning models over relational data, with an emphasis on the exploitation of the relational data structure to improve the runtime performance of the learning task. The tutorial has the following parts: (1) Database research for data science (2) Three main ideas to achieve performance improvements (2.1) Turn the ML problem into a DB problem (2.2) Exploit structure of the data and problem (2.3) Exploit engineering tools of a DB researcher (3) Avenues for future research
- 28 June 2021
- Published by Association for Computing Machinery (ACM)
- p. 160-163
Open AccessMachine learning over static and dynamic relational data
This tutorial overviews principles behind recent works on training and maintaining machine learning models over relational data, with an emphasis on the exploitation of the relational data structure to improve the runtime performance of the learning task. The tutorial has the following parts: (1) Database research for data science (2) Three main ideas to achieve performance improvements (2.1) Turn the ML problem into a DB problem (2.2) Exploit structure of the data and problem (2.3) Exploit engineering tools of a DB researcher (3) Avenues for future research
- 6 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8593-8597
The Thinkit System for Icassp2021 M2voc Challenge
In this paper, we introduce the low resource text-to-speech system from the ThinkIT team submitted to Multi-Speaker Multi-Style Voice Cloning Challenge (M2VoC). The challenge has two tasks: few-shot track1 provides 100 samples for each person and one-shot track2 offers 5 samples only. Each track contains two sub-tracks A and B. Instead of sub-track A, sub-track B can use extra public data besides the released data. But we participate in the sub-track A only. We choose the finetune as our backbone strategy. Our submitted systems include BERT based prosody boundary prediction module, FastSpeech based acoustic model to generate acoustic features from text input, and HIFIGAN based vocoder to generate waveform from acoustic features. Among them, acoustic models are susceptible to low resource speakers. To prevent over-fitting, we modified the acoustic model and split out validation set to assist the manual model selection. Evaluation results provided by the challenges organizers demonstrate the effectiveness of our system.
- 6 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 8593-8597
The Thinkit System for Icassp2021 M2voc Challenge
In this paper, we introduce the low resource text-to-speech system from the ThinkIT team submitted to Multi-Speaker Multi-Style Voice Cloning Challenge (M2VoC). The challenge has two tasks: few-shot track1 provides 100 samples for each person and one-shot track2 offers 5 samples only. Each track contains two sub-tracks A and B. Instead of sub-track A, sub-track B can use extra public data besides the released data. But we participate in the sub-track A only. We choose the finetune as our backbone strategy. Our submitted systems include BERT based prosody boundary prediction module, FastSpeech based acoustic model to generate acoustic features from text input, and HIFIGAN based vocoder to generate waveform from acoustic features. Among them, acoustic models are susceptible to low resource speakers. To prevent over-fitting, we modified the acoustic model and split out validation set to assist the manual model selection. Evaluation results provided by the challenges organizers demonstrate the effectiveness of our system.
- 31 March 2019
- Published by Springer Nature
- p. 111-129
A State Machine System for Insider Threat Detection
- 31 March 2019
- Published by Springer Nature
- p. 111-129
A State Machine System for Insider Threat Detection