Sort sets in the relational model
Journal of the ACM (JACM)
Dynamic functional dependencies and database aging
Journal of the ACM (JACM)
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On completeness of historical relational query languages
ACM Transactions on Database Systems (TODS)
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Approximate inference of functional dependencies from relations
ICDT '92 Selected papers of the fourth international conference on Database theory
On the feasibility of checking temporal integrity constraints
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Mining optimized association rules for numeric attributes
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
Constraint-generating dependencies
Journal of Computer and System Sciences
Extending Existing Dependency Theory to Temporal Databases
IEEE Transactions on Knowledge and Data Engineering
Data-Driven Discovery of Quantitative Rules in Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Mining Knowledge Rules from Databases: A Rough Set Approach
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Differential dependencies: Reasoning and discovery
ACM Transactions on Database Systems (TODS)
Querying temporal clinical databases on granular trends
Journal of Biomedical Informatics
| Hi-index | 0.00 |
We propose a temporal dependency, called trend dependency (TD), which captures a significant family of data evolution regularities. An example of such regularity is 驴Salaries of employees generally do not decrease.驴 TDs compare attributes over time using operators of $\{,\leq,\geq,\ne\}$. We define a satisfiability problem that is the dual of the logical implication problem for TDs and we investigate the computational complexity of both problems. As TDs allow expressing meaningful trends, 驴mining驴 them from existing databases is interesting. For the purpose of TD mining, TD satisfaction is characterized by support and confidence measures. We study the problem $\rm TDMINE$: given a temporal database, mine the TDs that conform to a given template and whose support and confidence exceed certain threshold values. The complexity of $\rm TDMINE$ is studied, as well as algorithms to solve the problem.