Dynamic functional dependencies and database aging
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A temporal relational model and a query language
Information Sciences: an International Journal
Dealing with granularity of time in temporal databases
CAiSE '91 Proceedings of the third international conference on Advanced information systems engineering
Temporal modules: an approach toward federated temporal databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Algebraic query languages on temporal databases with multiple time granularities
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extending Existing Dependency Theory to Temporal Databases
IEEE Transactions on Knowledge and Data Engineering
The Representation of a Temporal Data Model in the Relational Environment
Proceedings of the 4th International Working Conference SSDBM on Statistical and Scientific Database Management
Design of Temporal Relational Databases Based on Dynamic and Temporal Functional Dependencies
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modeling temporal primitives: back to basics
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Information systems research at George Mason University
ACM SIGMOD Record
Temporal granularity for unanchored temporal data
Proceedings of the seventh international conference on Information and knowledge management
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
Temporal Granularity: Completing the Puzzle
Journal of Intelligent Information Systems
Searching for dependencies at multiple abstraction levels
ACM Transactions on Database Systems (TODS)
A general framework for time granularity and its application to temporal reasoning
Annals of Mathematics and Artificial Intelligence
Supporting User-Defined Granularities in a Spatiotemporal Conceptual Model
Annals of Mathematics and Artificial Intelligence
Solving multi-granularity temporal constraint networks
Artificial Intelligence
Extending Existing Dependency Theory to Temporal Databases
IEEE Transactions on Knowledge and Data Engineering
Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences
IEEE Transactions on Knowledge and Data Engineering
Temporal Semantic Assumptions and Their Use in Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Trends in Databases: Reasoning and Mining
IEEE Transactions on Knowledge and Data Engineering
Symbolic User-Defined Periodicity in Temporal Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Knowledge Management in Heterogeneous Data Warehouse Environments
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Temporal Dependencies Generalized for Spatial and Other Dimensions
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
A Temporal Object-Oriented Data Warehouse Model
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Relationship Reification: A Temporal View
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Temporal coalescing with now granularity, and incomplete information
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Temporalized logics and automata for time granularity
Theory and Practice of Logic Programming
Data & Knowledge Engineering
Optimizing away joins on data streams
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
A Multi-classification Method of Temporal Data Based on Support Vector Machine
Computational Intelligence and Security
GSTP: a temporal reasoning system supporting multi-granularity temporal constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An agency-based framework for electronic business
CIA'99 Proceedings of the 3rd international conference on Cooperative information agents III
WaveSim transform for multi-channel signal data mining through linear regression PCA
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Object-relational representation of a conceptual model for temporal data warehouses
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
Temporal constraints with multiple granularities in smart homes
Designing Smart Homes
Temporal aggregation on user-defined granularities
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
The purpose of good database logical design is to eliminate data redundancy and isertion and deletion anomalies. In order to achieve this objective for temporal databases, the notions of temporal types, which formalize time granularities, and temporal functional dependencies (TFDs) are intrduced. A temporal type is a monotonic mapping from ticks of time (represented by positive integers) to time sets (represented by subsets of reals) and is used to capture various standard and user-defined calendars. A TFD is a proper extension of the traditional functional dependency and takes the form X →m Y, meaning that there is a unique value for Y during one tick of the temporal type &mgr; for one particular X value. An axiomatization for TFDs is given. Because a finite set TFDs usually implies an infinite number of TFDs, we introduce the notion of and give an axiomatization for a finite closure to effectively capture a finite set of implied TFDs that are essential of the logical design. Temporal normalization procedures with respect to TFDs are given. Specifically, temporal Boyce-Codd normal form (TBCNF) that avoids all data redundancies due to TFDs, and temporal third normal form (T3NF) that allows dependency preservation, are defined. Both normal forms are proper extensions of their traditional counterparts, BCNF and 3NF. Decompositition algorithms are presented that give lossless TBCNF decompositions and lossless, dependency-preserving, T3NF decompositions.