A foundation for conventional and temporal query optimization addressing duplicates and ordering

Giedrius Slivinskas, Christian S. Jensen, Richard Thomas Snodgrass

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Most real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may 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 foundation for query optimization that integrates conventional and temporal query optimization and is suitable for both conventional DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing for temporal queries, thus generalizing all existing approaches known to the authors. It includes a temporally extended relational algebra to which SQL and temporal SQL queries may be mapped, six types of algebraic equivalences, concrete query transformation rules that obey different equivalences, a procedure for determining which types of transformation rules are applicable for optimizing a query, and a query plan enumeration algorithm. The presented approach partitions the work required by the database implementor to develop a provably correct query optimizer into four stages: The database implementor has to 1) specify operations formally, 2) design and prove correct appropriate transformation rules that satisfy any of the six equivalence types, 3) augment the mechanism that determines when the different types of rules are applicable to ensure that the enumeration algorithm applies the rules correctly, and 4) ensure that the mapping generates a correct initial query plan.

Original languageEnglish (US)
Pages (from-to)21-49
Number of pages29
JournalIEEE Transactions on Knowledge and Data Engineering
Volume13
Issue number1
DOIs
StatePublished - Jan 2001

Fingerprint

Query languages
Algebra
Concretes
Processing

Keywords

  • Coalescing
  • Duplicate elimination
  • Query optimization
  • Temporal algebra
  • Temporal databases
  • Transformation rules

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Information Systems

Cite this

A foundation for conventional and temporal query optimization addressing duplicates and ordering. / Slivinskas, Giedrius; Jensen, Christian S.; Snodgrass, Richard Thomas.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No. 1, 01.2001, p. 21-49.

Research output: Contribution to journalArticle

@article{efcbb1337da345e59662125e2da5df1a,
title = "A foundation for conventional and temporal query optimization addressing duplicates and ordering",
abstract = "Most real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may 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 foundation for query optimization that integrates conventional and temporal query optimization and is suitable for both conventional DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing for temporal queries, thus generalizing all existing approaches known to the authors. It includes a temporally extended relational algebra to which SQL and temporal SQL queries may be mapped, six types of algebraic equivalences, concrete query transformation rules that obey different equivalences, a procedure for determining which types of transformation rules are applicable for optimizing a query, and a query plan enumeration algorithm. The presented approach partitions the work required by the database implementor to develop a provably correct query optimizer into four stages: The database implementor has to 1) specify operations formally, 2) design and prove correct appropriate transformation rules that satisfy any of the six equivalence types, 3) augment the mechanism that determines when the different types of rules are applicable to ensure that the enumeration algorithm applies the rules correctly, and 4) ensure that the mapping generates a correct initial query plan.",
keywords = "Coalescing, Duplicate elimination, Query optimization, Temporal algebra, Temporal databases, Transformation rules",
author = "Giedrius Slivinskas and Jensen, {Christian S.} and Snodgrass, {Richard Thomas}",
year = "2001",
month = "1",
doi = "10.1109/69.908979",
language = "English (US)",
volume = "13",
pages = "21--49",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "1",

}

TY - JOUR

T1 - A foundation for conventional and temporal query optimization addressing duplicates and ordering

AU - Slivinskas, Giedrius

AU - Jensen, Christian S.

AU - Snodgrass, Richard Thomas

PY - 2001/1

Y1 - 2001/1

N2 - Most real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may 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 foundation for query optimization that integrates conventional and temporal query optimization and is suitable for both conventional DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing for temporal queries, thus generalizing all existing approaches known to the authors. It includes a temporally extended relational algebra to which SQL and temporal SQL queries may be mapped, six types of algebraic equivalences, concrete query transformation rules that obey different equivalences, a procedure for determining which types of transformation rules are applicable for optimizing a query, and a query plan enumeration algorithm. The presented approach partitions the work required by the database implementor to develop a provably correct query optimizer into four stages: The database implementor has to 1) specify operations formally, 2) design and prove correct appropriate transformation rules that satisfy any of the six equivalence types, 3) augment the mechanism that determines when the different types of rules are applicable to ensure that the enumeration algorithm applies the rules correctly, and 4) ensure that the mapping generates a correct initial query plan.

AB - Most real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may 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 foundation for query optimization that integrates conventional and temporal query optimization and is suitable for both conventional DBMS architectures and ones where the temporal support is obtained via a layer on top of a conventional DBMS. This foundation captures duplicates and ordering for all queries, as well as coalescing for temporal queries, thus generalizing all existing approaches known to the authors. It includes a temporally extended relational algebra to which SQL and temporal SQL queries may be mapped, six types of algebraic equivalences, concrete query transformation rules that obey different equivalences, a procedure for determining which types of transformation rules are applicable for optimizing a query, and a query plan enumeration algorithm. The presented approach partitions the work required by the database implementor to develop a provably correct query optimizer into four stages: The database implementor has to 1) specify operations formally, 2) design and prove correct appropriate transformation rules that satisfy any of the six equivalence types, 3) augment the mechanism that determines when the different types of rules are applicable to ensure that the enumeration algorithm applies the rules correctly, and 4) ensure that the mapping generates a correct initial query plan.

KW - Coalescing

KW - Duplicate elimination

KW - Query optimization

KW - Temporal algebra

KW - Temporal databases

KW - Transformation rules

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

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

U2 - 10.1109/69.908979

DO - 10.1109/69.908979

M3 - Article

AN - SCOPUS:0035049151

VL - 13

SP - 21

EP - 49

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 1

ER -