Lexicographically Ordered Functional Dependencies and Their Application to Temporal Relations

  • Authors:

  • Wilfred Ng

  • Affiliations:

  • -

  • Venue:
  • IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose the ordered relational model and define Lexicographically Ordered Functional Dependencies (LOFDs) according to the lexicographical ordering on the Cartesian product of the domains associated with the involved attributes. An LOFD in the ordered relational model captures the semantics of a monotonicity property between two sets of data. We establish a set of sound and complete chase rules for LOFDs, and show that the implication problem for LOFDs is decidable. Defining temporal relations as a special case of linearly ordered relations over schemas consisting of the time, time-variant, and time-invariant attributes, we demonstrate that LOFDs are a useful semantic constraint, which can be employed to maintain the consistency between the time data in different time measurement systems. We also formally define Temporal Functional Dependencies (TFDs) in order to express the semantics of the temporally ordered data. A TFD can be expressed in term of a set of LOFDs, in which every element has a sequence of time attributes on its left-hand side and a single time-variant attribute on its right-hand side. Finally, we exhibit a sound and complete axiom system for TFDs.