TKHist: Cardinality Estimation for Join Queries via Histograms with Dominant Attribute Correlation Finding

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Li, Renrui, Ma, Qingzhi, Xu, Jiajie, Zhao, Lei, Liu, An
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918162471059456
author Li, Renrui
Ma, Qingzhi
Xu, Jiajie
Zhao, Lei
Liu, An
author_facet Li, Renrui
Ma, Qingzhi
Xu, Jiajie
Zhao, Lei
Liu, An
contents Cardinality estimation has long been crucial for cost-based database optimizers in identifying optimal query execution plans, attracting significant attention over the past decades. While recent advancements have significantly improved the accuracy of multi-table join query estimations, these methods introduce challenges such as higher space overhead, increased latency, and greater complexity, especially when integrated with the binary join framework. In this paper, we introduce a novel cardinality estimation method named TKHist, which addresses these challenges by relaxing the uniformity assumption in histograms. TKHist captures bin-wise non-uniformity information, enabling accurate cardinality estimation for join queries without filter predicates. Furthermore, we explore the attribute independent assumption, which can lead to significant over-estimation rather than under-estimation in multi-table join queries. To address this issue, we propose the dominating join path correlation discovery algorithm to highlight and manage correlations between join keys and filter predicates. Our extensive experiments on popular benchmarks demonstrate that TKHist reduces error variance by 2-3 orders of magnitude compared to SOTA methods, while maintaining comparable or lower memory usage.
format Preprint
id arxiv_https___arxiv_org_abs_2510_15368
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle TKHist: Cardinality Estimation for Join Queries via Histograms with Dominant Attribute Correlation Finding
Li, Renrui
Ma, Qingzhi
Xu, Jiajie
Zhao, Lei
Liu, An
Databases
Cardinality estimation has long been crucial for cost-based database optimizers in identifying optimal query execution plans, attracting significant attention over the past decades. While recent advancements have significantly improved the accuracy of multi-table join query estimations, these methods introduce challenges such as higher space overhead, increased latency, and greater complexity, especially when integrated with the binary join framework. In this paper, we introduce a novel cardinality estimation method named TKHist, which addresses these challenges by relaxing the uniformity assumption in histograms. TKHist captures bin-wise non-uniformity information, enabling accurate cardinality estimation for join queries without filter predicates. Furthermore, we explore the attribute independent assumption, which can lead to significant over-estimation rather than under-estimation in multi-table join queries. To address this issue, we propose the dominating join path correlation discovery algorithm to highlight and manage correlations between join keys and filter predicates. Our extensive experiments on popular benchmarks demonstrate that TKHist reduces error variance by 2-3 orders of magnitude compared to SOTA methods, while maintaining comparable or lower memory usage.
title TKHist: Cardinality Estimation for Join Queries via Histograms with Dominant Attribute Correlation Finding
topic Databases
url https://arxiv.org/abs/2510.15368