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. © 2010 Springer-Verlag.
CITATION STYLE
Dieng, C. T., Jen, T. Y., & Laurent, D. (2010). An efficient computation of frequent queries in a star schema. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6262 LNCS, pp. 225–239). https://doi.org/10.1007/978-3-642-15251-1_18
Mendeley helps you to discover research relevant for your work.