arXiv:2503.14929cs.DBcs.LG2025-03中稿 · PVLDB Vol 18

提出新模型ACE,精准估算集合型查询的返回结果数量

ACE: A Cardinality Estimator for Set-Valued Queries

  • 用注意力机制分析查询元素间关系,捕捉集合数据相关性
  • 在三个数据集上均优于现有方法,准确率与效率双提升
  • 适合处理推荐系统、信息检索中的集合型查询场景

基数估计是数据库系统的核心功能。现有估算器多针对数值或类别型数据,忽略了在现代应用(如信息检索和推荐系统)中频繁出现的集合型数据。少数现有方法要么偏向高频元素,要么依赖部分独立性假设,限制了实用性。本文提出ACE——一种基于注意力的集合型查询基数估算器。首先设计基于知识蒸馏的数据编码器,将数据集压缩为紧凑矩阵;再通过注意力机制查询分析器捕捉查询元素间的相关性;为应对变长查询,引入池化模块,后接多层感知机回归模型生成最终估算值。在三个具有不同查询元素分布的数据集上评估表明,ACE在准确率和效率上均超越当前最优方法。

原文摘要 · Abstract (English)

Cardinality estimation is a fundamental functionality in database systems. Most existing cardinality estimators focus on handling predicates over numeric or categorical data. They have largely omitted an important data type, set-valued data, which frequently occur in contemporary applications such as information retrieval and recommender systems. The few existing estimators for such data either favor high-frequency elements or rely on a partial independence assumption, which limits their practical applicability. We propose ACE, an Attention-based Cardinality Estimator for estimating the cardinality of queries over set-valued data. We first design a distillation-based data encoder to condense the dataset into a compact matrix. We then design an attention-based query analyzer to capture correlations among query elements. To handle variable-sized queries, a pooling module is introduced, followed by a regression model (MLP) to generate final cardinality estimates. We evaluate ACE on three datasets with varying query element distributions, demonstrating that ACE outperforms the state-of-the-art competitors in terms of both accuracy and efficiency.

基数估计集合查询注意力机制数据库

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。