Join operations in temporal databases

Dengfeng Gao, Christian S. Jensen, Richard Thomas Snodgrass, Michael D. Soo

Research output: Contribution to journalArticle

57 Citations (Scopus)

Abstract

Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins. We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.

Original languageEnglish (US)
Pages (from-to)2-29
Number of pages28
JournalVLDB Journal
Volume14
Issue number1
DOIs
StatePublished - Mar 2005

Fingerprint

Mathematical operators

Keywords

  • Attribute skew
  • Interval join
  • Partition join
  • Sort-merge join
  • Temporal Cartesian product
  • Temporal join
  • Timestamp skew

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems

Cite this

Join operations in temporal databases. / Gao, Dengfeng; Jensen, Christian S.; Snodgrass, Richard Thomas; Soo, Michael D.

In: VLDB Journal, Vol. 14, No. 1, 03.2005, p. 2-29.

Research output: Contribution to journalArticle

Gao, Dengfeng ; Jensen, Christian S. ; Snodgrass, Richard Thomas ; Soo, Michael D. / Join operations in temporal databases. In: VLDB Journal. 2005 ; Vol. 14, No. 1. pp. 2-29.
@article{24e4b598354649c9b2b72f336dae6b1c,
title = "Join operations in temporal databases",
abstract = "Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins. We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.",
keywords = "Attribute skew, Interval join, Partition join, Sort-merge join, Temporal Cartesian product, Temporal join, Timestamp skew",
author = "Dengfeng Gao and Jensen, {Christian S.} and Snodgrass, {Richard Thomas} and Soo, {Michael D.}",
year = "2005",
month = "3",
doi = "10.1007/s00778-003-0111-3",
language = "English (US)",
volume = "14",
pages = "2--29",
journal = "VLDB Journal",
issn = "1066-8888",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Join operations in temporal databases

AU - Gao, Dengfeng

AU - Jensen, Christian S.

AU - Snodgrass, Richard Thomas

AU - Soo, Michael D.

PY - 2005/3

Y1 - 2005/3

N2 - Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins. We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.

AB - Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins. We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.

KW - Attribute skew

KW - Interval join

KW - Partition join

KW - Sort-merge join

KW - Temporal Cartesian product

KW - Temporal join

KW - Timestamp skew

UR - http://www.scopus.com/inward/record.url?scp=16244391498&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=16244391498&partnerID=8YFLogxK

U2 - 10.1007/s00778-003-0111-3

DO - 10.1007/s00778-003-0111-3

M3 - Article

AN - SCOPUS:16244391498

VL - 14

SP - 2

EP - 29

JO - VLDB Journal

JF - VLDB Journal

SN - 1066-8888

IS - 1

ER -