The implication problem for functional and inclusion dependencies
Information and Control
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
Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
Theoretical Computer Science
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
Why is the snowflake schema a good data warehouse design?
Information Systems
A Dichotomous Algorithm for Association Rule Mining
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
Mining tree queries in a graph
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Mining functional dependencies from data
Data Mining and Knowledge Discovery
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
Unary and n-ary inclusion dependency discovery in relational databases
Journal of Intelligent Information Systems
Mining frequent conjunctive queries in star schemas
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Mining interesting sets and rules in relational databases
Proceedings of the 2010 ACM Symposium on Applied Computing
Computing Supports of Conjunctive Queries on Relational Tables with Functional Dependencies
Fundamenta Informaticae
Discovery and application of functional dependencies in conjunctive query mining
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
An efficient computation of frequent queries in a star schema
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Discovering Conditional Functional Dependencies
IEEE Transactions on Knowledge and Data Engineering
Towards mining frequent queries in star schemes
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
| Hi-index | 0.00 |
We address the issue of mining frequent conjunctive queries in a relational database, a problem known to be intractable even for conjunctive queries over a single table. In this article, we show that mining frequent projection-selection-join queries becomes tractable if joins are performed along keys and foreign keys, in a database satisfying functional and inclusion dependencies, under certain restrictions. We note that these restrictions cover most practical cases, including databases operating over star schemas, snow-flake schemas and constellation schemas. In our approach, we define an equivalence relation over queries using a pre-ordering with respect to which the support is shown to be anti-monotonic. We propose a level-wise algorithm for computing all frequent queries by exploiting the fact that equivalent queries have the same support. We report on experiments showing that, in our context, mining frequent projection-selection-join queries is indeed tractable, even for large data sets.