TY - JOUR
T1 - Efficient sequenced temporal integrity checking
AU - Li, Wei
AU - Snodgrass, Richard T.
AU - Deng, Shiyan
AU - Gattu, Vineel K.
AU - Kasthurirangan, Aravindan
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
U2 - 10.1109/ICDE.2001.914821
DO - 10.1109/ICDE.2001.914821
M3 - Article
AN - SCOPUS:0035019284
SN - 1084-4627
SP - 131
EP - 140
JO - Proceedings - International Conference on Data Engineering
JF - Proceedings - International Conference on Data Engineering
ER -