Intelligent Database Flexible Querying System by Approximate Query Processing
Oussama Tlili, Minyar Sassi, Habib Ounelli

TL;DR
This paper proposes an approach that combines Formal Concepts Analysis and Approximate Query Processing to enable faster, approximate flexible querying in databases, especially for aggregate functions, reducing response time.
Contribution
It introduces a novel method integrating FCA with AQP to improve the efficiency of flexible database queries involving aggregates.
Findings
Significantly reduces query response time for aggregate functions
Enables approximate answers in flexible querying scenarios
Improves efficiency without sacrificing essential accuracy
Abstract
Database flexible querying is an alternative to the classic one for users. The use of Formal Concepts Analysis (FCA) makes it possible to make approximate answers that those turned over by a classic DataBase Management System (DBMS). Some applications do not need exact answers. However, flexible querying can be expensive in response time. This time is more significant when the flexible querying require the calculation of aggregate functions ("Sum", "Avg", "Count", "Var" etc.). In this paper, we propose an approach which tries to solve this problem by using Approximate Query Processing (AQP).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Rough Sets and Fuzzy Logic
