Query plans for conventional and temporal queries involving duplicates and ordering

Giedrius Slivinskas, Christian S. Jensen, Richard T. Snodgrass

Research output: Contribution to conferencePaper

7 Scopus citations

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)
Pages547-558
Number of pages12
StatePublished - Jan 1 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

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Fingerprint Dive into the research topics of 'Query plans for conventional and temporal queries involving duplicates and ordering'. Together they form a unique fingerprint.

  • Cite this

    Slivinskas, G., Jensen, C. S., & Snodgrass, R. T. (2000). Query plans for conventional and temporal queries involving duplicates and ordering. 547-558. Paper presented at 2000 IEEE 16th International Conference on Data Engineering (ICDE'00), San Diego, CA, USA, .