An Efficient Computation of Frequent Queries in a Star Schema

Cheikh Tidiane Dieng (1, 2) , Tao-Yuan Jen (1) , Dominique Laurent (1)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 LANI - Laboratoire d'Analyse Numérique et Informatique [Sénégal]

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.

Mots clés: Frequent Queries; Functional Dependencies; Inclusion Dependencies; Query Comparison; Star Schemas

Domaines: Base de données [cs.DB]

Cheikh Tidiane Dieng, Tao-Yuan Jen, Dominique Laurent. An Efficient Computation of Frequent Queries in a Star Schema. Conference on Database and Expert Systems Applications (DEXA'2010), 2010, Spain. pp.225-239. ⟨hal-00612808⟩