Discovery and Application of Functional Dependencies in Conjunctive Query Mining

Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we restrict to the simple, but appealing subclass of simple conjunctive queries. The proposed algorithm makes use of the functional dependencies of the database to optimise the generation of queries and prune redundant queries. Furthermore, our algorithm is capable of detecting previously unknown functional dependencies that hold on the database relations as well as on joins of relations. These detected dependencies are subsequently used to prune redundant queries. We propose an efficient database-oriented implementation of our algorithm using SQL, and provide several promising experimental results.

• Type: Conference
• Year: 2010
• Where: DAWAK
• Authors: Bart Goethals, Dominique Laurent, Wim Le Page
• Keywords: Algorithm, DAWAK 2010, Functional Dependencies, Information Technology, Redundant Queries