Efficient Approximation Framework for Attribute Recommendation
Xingguang Chen, Fangyuan Zhang, Jinchao Huang, Sibo Wang
Abstract
Trend analysis is a fundamental type of analytical query in online analytical processing (OLAP) systems. In trend analysis, a key step is to identify k valuable attributes whose distributions in two subsets under different predicates significantly differ for further investigation, where the difference is measured by metric functions. However, the exact solution that involves scanning all records is prohibitively expensive, particularly when handling large datasets in the era of big data. To minimize unnecessary data access, the existing state-of-the-art solution TopKAttr adopts sampling to avoid the expensive data scan. However, their solution still has two main drawbacks. Firstly, their solution is tailored only for two limited metric functions: the Earth Mover distance and Euclidean distance, and cannot be generalized to more complicated metric functions. Besides, their solution still aims to return the exact top-k answers via the sampling method, which still causes high running costs as shown in our experiment. Motivated by these limitations, we propose a general approximation framework for attribute recommendation that efficiently returns the top-k attributes with theoretical guarantees while supporting an extensive range of metric functions, such as the Kolmogorov-Smirnov test (KS-test), Chebyshev distance, the Earth Mover distance, Euclidean distance, and with the potential to more metrics. The key to our framework is a new bound estimation strategy that can be applied to a wide spectrum of metrics, as we listed above. Based on our estimation framework, we further devise an efficient approximation algorithm with theoretical guarantees to answer the top-k queries, which is widely used in attribute recommendation. Extensive experiments on four real large datasets show that our framework gains up to an order of magnitude speed-up and consistently high accuracy compared to TopKAttr, providing a promising alternative for attribute recommendation in OLAP systems.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 4a3311b3-b9ce-4b60-853c-06b42f12b115Related papers
- Anytime Algorithms for Approximate Functional DependenciesSanjivni Rana, Junya Ogawa, Suraj Shetiya, Senjuti Basu Roy et al.KDD 2025
- Comprehensible Counterfactual Explanation on Kolmogorov-Smirnov TestZicun Cong, Lingyang Chu, Yu Yang, Jian PeiVLDB 2021 · 13 citations
- TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph DatabaseKai Huang, Haibo Hu, Qingqing Ye, Kai Tian et al.SIGMOD 2023 · 4 citations
- Supporting Hard Queries over Probabilistic PreferencesHaoyue Ping, Julia Stoyanovich, Benny KimelfeldVLDB 2020 · 1 citation
- Directional Queries: Making Top-k Queries More Effective in Discovering Relevant ResultsPaolo Ciaccia, Davide MartinenghiSIGMOD 2025 · 7 citations
