2012 | OriginalPaper | Buchkapitel
Approximate Query Processing for Database Flexible Querying with Aggregates
verfasst von : Minyar Sassi, Oussama Tlili, Habib Ounelli
Erschienen in: Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Database flexible querying is an alternative to the classic one for users. The use of Formal Concepts Analysis (FCA) makes it possible to turn approximate answers that those turned over by a classic DataBase Management System (DBMS). Some applications do not need exact answers. However, database 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.). Online aggregation enables a user to issue an SQL aggregate query, see results immediately, and adjust the processing as the query runs. In this case, the user sees refining estimates of the final aggregation results. In spite of the success which known this method, until now, it hasn’t been integrated in flexible querying systems. In this article, we propose an approach which tries to solve this problem by using approximate query processing (AQP). This approach allow user to i) wrote flexible query contains linguistics terms, ii) observe the progress of their aggregation queries and iii) control execution on the fly. We report on an initial implementation of online aggregation in a flexible querying system.