Information Processing Letters
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logical design for temporal databases with multiple granularities
ACM Transactions on Database Systems (TODS)
Reasoning about qualitative trends in databases
Information Systems
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
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Extending Existing Dependency Theory to Temporal Databases
IEEE Transactions on Knowledge and Data Engineering
Querying Multidimensional Databases
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Modeling Spatial and Temporal Set-Based Constraints During Conceptual Database Design
Information Systems Research
| Hi-index | 0.00 |
Recently, there has been a lot of interest in temporal granularity, and its applications in temporal dependency theory and data mining. Generalization hierarchies used in multi-dimensional databases and OLAP serve a role similar to that of time granularity in temporal databases, but they also apply to non-temporal dimensions, like space. In this paper, we first generalize temporal functional dependencies for non-temporal dimensions, which leads to the notion of roll-up dependency (RUD). We show the applicability of RUDs in conceptual modeling and data mining. We then indicate that the notion of time granularity used in temporal databases is generally more expressive than the generalization hierarchies in multi-dimensional databases, and show how this surplus expressiveness can be introduced in non-temporal dimensions, which leads to the formalism of RUD with negation (RUD). A complete axiomatization for reasoning about RUD is given.