Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Value Equivalence

  • Nikos A. Lorentzos
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1433

Definition

In temporal databases, the scheme of a temporal relation S has the form S(E, I) where E and I represent two disjoint sets of attributes, termed by some authors explicit and implicit, respectively. Explicit are the attributes in which ordinary data are recorded, such as Employee_Id, Name, Salary, etc. Implicit are the attributes in which either valid time (one or more) or transaction time is recorded. Given two tuples (e1, i1) and (e2, i2) with the scheme of S, it is said that there is a value equivalence between them if and only if e1 = e2. Equivalently, it is said that (e1, i1) and (e2, i2) are value equivalent.

Example

Consider one tuple, (Alex, 100, d400, d799), with scheme SALARY (Name, Amount, ValidTime), indicating that Alex’s salary was 100 on each of the dates d400, d401,…,d799. Let also another tuple of the same scheme be (Alex, 100, d500, d899). For the given scheme, E = {Name, Amount} and I = {ValidTime}. Given that both tuples have the same value for Name and...

This is a preview of subscription content, log in to check access.

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Informatics Laboratory, Department of Agricultural Economics and Rural DevelopmentAgricultural University of AthensAthensGreece

Section editors and affiliations

  • Richard T. Snodgrass
    • 1
  • Christian S. Jensen
    • 2
  1. 1.Department of Computer ScienceUniversity of ArizonaTucsonUSA
  2. 2.Aalborg UniversityAalborg ØstDenmark