Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Logical design for temporal databases with multiple granularities
ACM Transactions on Database Systems (TODS)
Fast discovery of association rules
Advances in knowledge discovery and data mining
Temporal FDs on complex objects
ACM Transactions on Database Systems (TODS)
Discovering roll-up dependencies
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
On the Complexity of Mining Quantitative Association Rules
Data Mining and Knowledge Discovery
A Feasibility and Performance Study of Dependency Inference
Proceedings of the Fifth International Conference on Data Engineering
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Querying Multidimensional Databases
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Extracting semantics from data cubes using cube transversals and closures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Exploratory medical knowledge discovery: experiences and issues
ACM SIGKDD Explorations Newsletter
On approximation measures for functional dependencies
Information Systems - Special issue: ADBIS 2002: Advances in databases and information systems
On generating near-optimal tableaux for conditional functional dependencies
Proceedings of the VLDB Endowment
Extracting semantics in OLAP databases using emerging cubes
Information Sciences: an International Journal
Functional dependency discovery via Bayes net analysis
MAMECTIS/NOLASC/CONTROL/WAMUS'11 Proceedings of the 13th WSEAS international conference on mathematical methods, computational techniques and intelligent systems, and 10th WSEAS international conference on non-linear analysis, non-linear systems and chaos, and 7th WSEAS international conference on dynamical systems and control, and 11th WSEAS international conference on Wavelet analysis and multirate systems: recent researches in computational techniques, non-linear systems and control
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
Editorial: Efficient discovery of similarity constraints for matching dependencies
Data & Knowledge Engineering
| Hi-index | 0.00 |
The notion of roll-up dependency (RUD) extends functional dependencies with generalization hierarchies. RUDs can be applied in OLAP and database design. The problem of discovering RUDs in large databases is at the center of this paper. An algorithm is provided that relies on a number of theoretical results. The algorithm has been implemented; results on two real-life datasets are given. The extension of functional dependency (FD) with roll-ups turns out to capture meaningful rules that are outside the scope of classical FD mining. Performance figures show that RUDs can be discovered in linear time in the number of tuples of the input dataset.