Query plans for conventional and temporal queries involving duplicates and ordering

Giedrius Slivinskas, Christian S. Jensen, Richard Thomas Snodgrass

Research output: Chapter in Book/Report/Conference proceedingChapter

7 Citations (Scopus)

Abstract

Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications could benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a general, algebraic foundation for query optimization that integrates conventional and temporal query optimization and is suitable for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well as coalescing for temporal queries, this foundation formalizes and generalizes existing approaches.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherIEEE
Pages547-558
Number of pages12
StatePublished - 2000
Externally publishedYes
Event2000 IEEE 16th International Conference on Data Engineering (ICDE'00) - San Diego, CA, USA
Duration: Feb 29 2000Mar 3 2000

Other

Other2000 IEEE 16th International Conference on Data Engineering (ICDE'00)
CitySan Diego, CA, USA
Period2/29/003/3/00

Fingerprint

Query languages
Processing

ASJC Scopus subject areas

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

Cite this

Slivinskas, G., Jensen, C. S., & Snodgrass, R. T. (2000). Query plans for conventional and temporal queries involving duplicates and ordering. In Proceedings - International Conference on Data Engineering (pp. 547-558). IEEE.

Query plans for conventional and temporal queries involving duplicates and ordering. / Slivinskas, Giedrius; Jensen, Christian S.; Snodgrass, Richard Thomas.

Proceedings - International Conference on Data Engineering. IEEE, 2000. p. 547-558.

Research output: Chapter in Book/Report/Conference proceedingChapter

Slivinskas, G, Jensen, CS & Snodgrass, RT 2000, Query plans for conventional and temporal queries involving duplicates and ordering. in Proceedings - International Conference on Data Engineering. IEEE, pp. 547-558, 2000 IEEE 16th International Conference on Data Engineering (ICDE'00), San Diego, CA, USA, 2/29/00.
Slivinskas G, Jensen CS, Snodgrass RT. Query plans for conventional and temporal queries involving duplicates and ordering. In Proceedings - International Conference on Data Engineering. IEEE. 2000. p. 547-558
Slivinskas, Giedrius ; Jensen, Christian S. ; Snodgrass, Richard Thomas. / Query plans for conventional and temporal queries involving duplicates and ordering. Proceedings - International Conference on Data Engineering. IEEE, 2000. pp. 547-558
@inbook{8bd5fe03ba7b488ea11d17b238d25b37,
title = "Query plans for conventional and temporal queries involving duplicates and ordering",
abstract = "Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications could benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a general, algebraic foundation for query optimization that integrates conventional and temporal query optimization and is suitable for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well as coalescing for temporal queries, this foundation formalizes and generalizes existing approaches.",
author = "Giedrius Slivinskas and Jensen, {Christian S.} and Snodgrass, {Richard Thomas}",
year = "2000",
language = "English (US)",
pages = "547--558",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE",

}

TY - CHAP

T1 - Query plans for conventional and temporal queries involving duplicates and ordering

AU - Slivinskas, Giedrius

AU - Jensen, Christian S.

AU - Snodgrass, Richard Thomas

PY - 2000

Y1 - 2000

N2 - Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications could benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a general, algebraic foundation for query optimization that integrates conventional and temporal query optimization and is suitable for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well as coalescing for temporal queries, this foundation formalizes and generalizes existing approaches.

AB - Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications could benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a general, algebraic foundation for query optimization that integrates conventional and temporal query optimization and is suitable for providing temporal support both via a stand-alone temporal DBMS and via a layer on top of a conventional DBMS. By capturing duplicate removal and retention and order preservation for all queries, as well as coalescing for temporal queries, this foundation formalizes and generalizes existing approaches.

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

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

M3 - Chapter

AN - SCOPUS:0033877654

SP - 547

EP - 558

BT - Proceedings - International Conference on Data Engineering

PB - IEEE

ER -