CME

A temporal relational model for efficient coalescing

Mohammed Al-Kateb, Essam Mansour, Mohamed E. El-Sharkawi

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

1 Citation (Scopus)

Abstract

Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs coalescing is very high. However, coalescing is an expensive and time consuming operation. In this paper1 we present a novel temporal relational model through which coalescing becomes quite simple. The basic idea is to augment each time-varying attribute in a temporal relation with two additional attributes that trace changes in values of the corresponding time-varying attribute. One attribute traces changes in values with respect to each individual instance (i.e. tuples having the same key value), while the other attribute traces changes in values globally for all instances (i.e. all tuples in the temporal relation). Using these tracing attributes, coalescing could be easily implemented through a quite simple join-free group-by query. The coalescing query is fully processed and optimized by the underlying database management system.

Original languageEnglish
Title of host publicationProceedings of the International Workshop on Temporal Representation and Reasoning
Pages83-89
Number of pages7
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event12th International Symposium on Temporal Representation and Reasoning, TIME 2005 - Burlington, VT, United States
Duration: 23 Jun 200525 Jun 2005

Other

Other12th International Symposium on Temporal Representation and Reasoning, TIME 2005
CountryUnited States
CityBurlington, VT
Period23/6/0525/6/05

Fingerprint

Relational Model
Attribute
Trace
Query
Time-varying
Temporal Databases
Timestamp
Tracing
Free Group
Join
Overlapping
Likelihood
Adjacent

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Al-Kateb, M., Mansour, E., & El-Sharkawi, M. E. (2005). CME: A temporal relational model for efficient coalescing. In Proceedings of the International Workshop on Temporal Representation and Reasoning (pp. 83-89). [1443355] https://doi.org/10.1109/TIME.2005.16

CME : A temporal relational model for efficient coalescing. / Al-Kateb, Mohammed; Mansour, Essam; El-Sharkawi, Mohamed E.

Proceedings of the International Workshop on Temporal Representation and Reasoning. 2005. p. 83-89 1443355.

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

Al-Kateb, M, Mansour, E & El-Sharkawi, ME 2005, CME: A temporal relational model for efficient coalescing. in Proceedings of the International Workshop on Temporal Representation and Reasoning., 1443355, pp. 83-89, 12th International Symposium on Temporal Representation and Reasoning, TIME 2005, Burlington, VT, United States, 23/6/05. https://doi.org/10.1109/TIME.2005.16
Al-Kateb M, Mansour E, El-Sharkawi ME. CME: A temporal relational model for efficient coalescing. In Proceedings of the International Workshop on Temporal Representation and Reasoning. 2005. p. 83-89. 1443355 https://doi.org/10.1109/TIME.2005.16
Al-Kateb, Mohammed ; Mansour, Essam ; El-Sharkawi, Mohamed E. / CME : A temporal relational model for efficient coalescing. Proceedings of the International Workshop on Temporal Representation and Reasoning. 2005. pp. 83-89
@inproceedings{a0b5d08ecebf480db2433b2e69e66750,
title = "CME: A temporal relational model for efficient coalescing",
abstract = "Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs coalescing is very high. However, coalescing is an expensive and time consuming operation. In this paper1 we present a novel temporal relational model through which coalescing becomes quite simple. The basic idea is to augment each time-varying attribute in a temporal relation with two additional attributes that trace changes in values of the corresponding time-varying attribute. One attribute traces changes in values with respect to each individual instance (i.e. tuples having the same key value), while the other attribute traces changes in values globally for all instances (i.e. all tuples in the temporal relation). Using these tracing attributes, coalescing could be easily implemented through a quite simple join-free group-by query. The coalescing query is fully processed and optimized by the underlying database management system.",
author = "Mohammed Al-Kateb and Essam Mansour and El-Sharkawi, {Mohamed E.}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/TIME.2005.16",
language = "English",
pages = "83--89",
booktitle = "Proceedings of the International Workshop on Temporal Representation and Reasoning",

}

TY - GEN

T1 - CME

T2 - A temporal relational model for efficient coalescing

AU - Al-Kateb, Mohammed

AU - Mansour, Essam

AU - El-Sharkawi, Mohamed E.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs coalescing is very high. However, coalescing is an expensive and time consuming operation. In this paper1 we present a novel temporal relational model through which coalescing becomes quite simple. The basic idea is to augment each time-varying attribute in a temporal relation with two additional attributes that trace changes in values of the corresponding time-varying attribute. One attribute traces changes in values with respect to each individual instance (i.e. tuples having the same key value), while the other attribute traces changes in values globally for all instances (i.e. all tuples in the temporal relation). Using these tracing attributes, coalescing could be easily implemented through a quite simple join-free group-by query. The coalescing query is fully processed and optimized by the underlying database management system.

AB - Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs coalescing is very high. However, coalescing is an expensive and time consuming operation. In this paper1 we present a novel temporal relational model through which coalescing becomes quite simple. The basic idea is to augment each time-varying attribute in a temporal relation with two additional attributes that trace changes in values of the corresponding time-varying attribute. One attribute traces changes in values with respect to each individual instance (i.e. tuples having the same key value), while the other attribute traces changes in values globally for all instances (i.e. all tuples in the temporal relation). Using these tracing attributes, coalescing could be easily implemented through a quite simple join-free group-by query. The coalescing query is fully processed and optimized by the underlying database management system.

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

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

U2 - 10.1109/TIME.2005.16

DO - 10.1109/TIME.2005.16

M3 - Conference contribution

SP - 83

EP - 89

BT - Proceedings of the International Workshop on Temporal Representation and Reasoning

ER -