Monotonic Cardinality Estimation Of Similarity Selection: A Deep Learning Approach

Abstract

Due to the outstanding capability of capturing underlying data distributions, deep learning techniques have been recently utilized for a series of traditional database problems. In this paper, we investigate the possibilities of utilizing deep learning for cardinality estimation of similarity selection. Answering this problem accurately and efficiently is essential to many data management applications, especially for query optimization. Moreover, in some applications the estimated cardinality is supposed to be consistent and interpretable. Hence a monotonic estimation w.r.t. the query threshold is preferred. We propose a novel and generic method that can be applied to any data type and distance function. Our method consists of a feature extraction model and a regression model. The feature extraction model transforms original data and threshold to a Hamming space, in which a deep learning-based regression model is utilized to exploit the incremental property of cardinality w.r.t. the th

Stats

• citations18
• S2 citations—
• github stars0
• HF likes0
• heat score9.59
• arxiv keywang2020monotonic

Related papers

• Deep Metric Learning Using Similarities From Nonlinear Rank Approximations (2019)2.26
• Active Learning Of Ordinal Embeddings: A User Study On Football Data (2022)0.00
• Improving Calibration In Deep Metric Learning With Cross-example Softmax (2020)0.00
• Active Metric Learning And Classification Using Similarity Queries (2022)0.00
• Discriminative Learning Of Similarity And Group Equivariant Representations (2018)0.00
• Metric Learning By Similarity Network For Deep Semi-supervised Learning (2020)3.58
• Directional Statistics-based Deep Metric Learning For Image Classification And Retrieval (2018)13.05
• Deep Class-wise Hashing: Semantics-preserving Hashing Via Class-wise Loss (2018)11.19