An efficient computation of frequent queries in a star schema

Authors:
Cheikh Tidiane Dieng;Tao-Yuan Jen;Dominique Laurent
Affiliations:
ETIS, CNRS, ENSEA, Université de Cergy Pontoise, France and Laboratoire d'Analyse Numérique et Informatique, Université Gaston-Berger, Saint-Louis, Senegal;ETIS, CNRS, ENSEA, Université de Cergy Pontoise, France;ETIS, CNRS, ENSEA, Université de Cergy Pontoise, France
Venue:
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Year:
2010

Citing 10
Cited 1

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Fast discovery of association rules

Advances in knowledge discovery and data mining
An Extension to SQL for Mining Association Rules

Data Mining and Knowledge Discovery
Composition of Mining Contexts for Efficient Extraction of Association Rules

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Relational Association Rules: Getting WARMeR

Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Mining Association Rules in Multiple Relations

ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
Mining tree queries in a graph

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Answering constraint-based mining queries on itemsets using previous materialized results

Journal of Intelligent Information Systems
Mining all frequent projection-selection queries from a relational table

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Towards mining frequent queries in star schemes

KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases

Mining frequent conjunctive queries using functional and inclusion dependencies

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although the problem of computing frequent queries in relational databases is known to be intractable, it has been argued in our previous work that using functional and inclusion dependencies, computing frequent conjunctive queries becomes feasible for databases operating over a star schema. However, the implementation considered in this previous work showed severe limitations for large fact tables. The main contribution of this paper is to overcome these limitations using appropriate auxiliary tables. We thus introduce a novel algorithm, called Frequent Query Finder (FQF), and we report on experiments showing that our algorithm allows for an effective and efficient computation of frequent queries.