Efficient sequenced temporal integrity checking

W. Li, Richard Thomas Snodgrass, S. Deng, V. K. Gattu, A. Kasthurirangan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Primary key and referential integrity are the most widely used integrity constraints in relational databases. Each has a sequenced analogue in temporal databases, in which the constraint must apply independently at every point in time. In this paper, we assume a stratum approach, which expresses the checking in conventional SQL, as triggers on period-stamped relations. We evaluate several novel approaches that exploit B+-tree indexes to enable efficient checking of sequenced primary key (SPK) and referential integrity (SRI) constraints. We start out with a brute force SPK algorithm, then adapt the Relational Intervaltree overlap algorithm. After that, we propose a new method, the Straight Traversal algorithm, which utilizes the B+-tree more directly to identify when multiple key values are present. Our evaluation, on two platforms, shows that Straight Traversal algorithm approaches the performance of built-in nontemporal primary key and referential integrity checking, with constant time per tuple.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
Pages131-140
Number of pages10
StatePublished - 2001
Event17th International Conference on Data Engineering - Heidelberg, Germany
Duration: Apr 2 2001Apr 6 2001

Other

Other17th International Conference on Data Engineering
CountryGermany
CityHeidelberg
Period4/2/014/6/01

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Li, W., Snodgrass, R. T., Deng, S., Gattu, V. K., & Kasthurirangan, A. (2001). Efficient sequenced temporal integrity checking. In Proceedings - International Conference on Data Engineering (pp. 131-140)

Efficient sequenced temporal integrity checking. / Li, W.; Snodgrass, Richard Thomas; Deng, S.; Gattu, V. K.; Kasthurirangan, A.

Proceedings - International Conference on Data Engineering. 2001. p. 131-140.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, W, Snodgrass, RT, Deng, S, Gattu, VK & Kasthurirangan, A 2001, Efficient sequenced temporal integrity checking. in Proceedings - International Conference on Data Engineering. pp. 131-140, 17th International Conference on Data Engineering, Heidelberg, Germany, 4/2/01.
Li W, Snodgrass RT, Deng S, Gattu VK, Kasthurirangan A. Efficient sequenced temporal integrity checking. In Proceedings - International Conference on Data Engineering. 2001. p. 131-140
Li, W. ; Snodgrass, Richard Thomas ; Deng, S. ; Gattu, V. K. ; Kasthurirangan, A. / Efficient sequenced temporal integrity checking. Proceedings - International Conference on Data Engineering. 2001. pp. 131-140
@inproceedings{2c3698f414c34893948caf6388663c57,
title = "Efficient sequenced temporal integrity checking",
abstract = "Primary key and referential integrity are the most widely used integrity constraints in relational databases. Each has a sequenced analogue in temporal databases, in which the constraint must apply independently at every point in time. In this paper, we assume a stratum approach, which expresses the checking in conventional SQL, as triggers on period-stamped relations. We evaluate several novel approaches that exploit B+-tree indexes to enable efficient checking of sequenced primary key (SPK) and referential integrity (SRI) constraints. We start out with a brute force SPK algorithm, then adapt the Relational Intervaltree overlap algorithm. After that, we propose a new method, the Straight Traversal algorithm, which utilizes the B+-tree more directly to identify when multiple key values are present. Our evaluation, on two platforms, shows that Straight Traversal algorithm approaches the performance of built-in nontemporal primary key and referential integrity checking, with constant time per tuple.",
author = "W. Li and Snodgrass, {Richard Thomas} and S. Deng and Gattu, {V. K.} and A. Kasthurirangan",
year = "2001",
language = "English (US)",
pages = "131--140",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - Efficient sequenced temporal integrity checking

AU - Li, W.

AU - Snodgrass, Richard Thomas

AU - Deng, S.

AU - Gattu, V. K.

AU - Kasthurirangan, A.

PY - 2001

Y1 - 2001

N2 - Primary key and referential integrity are the most widely used integrity constraints in relational databases. Each has a sequenced analogue in temporal databases, in which the constraint must apply independently at every point in time. In this paper, we assume a stratum approach, which expresses the checking in conventional SQL, as triggers on period-stamped relations. We evaluate several novel approaches that exploit B+-tree indexes to enable efficient checking of sequenced primary key (SPK) and referential integrity (SRI) constraints. We start out with a brute force SPK algorithm, then adapt the Relational Intervaltree overlap algorithm. After that, we propose a new method, the Straight Traversal algorithm, which utilizes the B+-tree more directly to identify when multiple key values are present. Our evaluation, on two platforms, shows that Straight Traversal algorithm approaches the performance of built-in nontemporal primary key and referential integrity checking, with constant time per tuple.

AB - Primary key and referential integrity are the most widely used integrity constraints in relational databases. Each has a sequenced analogue in temporal databases, in which the constraint must apply independently at every point in time. In this paper, we assume a stratum approach, which expresses the checking in conventional SQL, as triggers on period-stamped relations. We evaluate several novel approaches that exploit B+-tree indexes to enable efficient checking of sequenced primary key (SPK) and referential integrity (SRI) constraints. We start out with a brute force SPK algorithm, then adapt the Relational Intervaltree overlap algorithm. After that, we propose a new method, the Straight Traversal algorithm, which utilizes the B+-tree more directly to identify when multiple key values are present. Our evaluation, on two platforms, shows that Straight Traversal algorithm approaches the performance of built-in nontemporal primary key and referential integrity checking, with constant time per tuple.

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

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

M3 - Conference contribution

AN - SCOPUS:0035019284

SP - 131

EP - 140

BT - Proceedings - International Conference on Data Engineering

ER -