The derivation problem of summary data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
A database perspective on knowledge discovery
Communications of the ACM
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
On-line warehouse view maintenance
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query flocks: a generalization of association-rule mining
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Deriving orthogonality to optimize the search for summary data
Information Systems
Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching
Machine Learning - Special issue on multistrategy learning
Unexpectedness as a measure of interestingness in knowledge discovery
Decision Support Systems - Special issue on WITS '97
Use and reuse of association rules in an OLAP environment
Proceedings of the 2000 information resources management association international conference on Challenges of information technology management in the 21st century
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Discovery in multi-attribute data with user-defined constraints
ACM SIGKDD Explorations Newsletter
Knowledge refinement based on the discovery of unexpected patterns in data mining
Decision Support Systems - Special issue: Formal modeling and electronic commerce
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Rewriting OLAP Queries Using Materialized Views and Dimension Hierarchies in Data Warehouses
Proceedings of the 17th International Conference on Data Engineering
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A New SQL-like Operator for Mining Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Summarizability in OLAP and Statistical Data Bases
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
A perspective on inductive databases
ACM SIGKDD Explorations Newsletter
A Theory of Inductive Query Answering
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Evaluation of Queries with Mining Predicates
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Optimization of a language for data mining
Proceedings of the 2003 ACM symposium on Applied computing
Optimization of association rules extraction through exploitation of context dependent constraints
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Software—Practice & Experience
On interactive pattern mining from relational databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
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
| Hi-index | 0.00 |
In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user interacts with the DBMS using advanced, constraint-based languages for data mining where constraints have been specifically introduced to increase the relevance of the results and, at the same time, to reduce its volume. In this paper we study the problem of mining frequent itemsets using an inductive database. We propose a technique for query answering which consists in rewriting the query in terms of union and intersection of the result sets of other queries, previously executed and materialized. Unfortunately, the exploitation of past queries is not always applicable. We then present sufficient conditions for the optimization to apply and show that these conditions are strictly connected with the presence of functional dependencies between the attributes involved in the queries. We show some experiments on an initial prototype of an optimizer which demonstrates that this approach to query answering is viable and in many practical cases it drastically reduces the query execution time.