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 language | English (US) |
|---|---|
| Pages | 547-558 |
| Number of pages | 12 |
| State | Published - 2000 |
| Externally published | Yes |
| Event | 2000 IEEE 16th International Conference on Data Engineering (ICDE'00) - San Diego, CA, USA Duration: Feb 29 2000 → Mar 3 2000 |
Other
| Other | 2000 IEEE 16th International Conference on Data Engineering (ICDE'00) |
|---|---|
| City | San Diego, CA, USA |
| Period | 2/29/00 → 3/3/00 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Information Systems