Abstract:
Abstract: Queries in temporal databases often employ the coalesce operator, either to coalesce results of projections, or data which are not coalesced upon storage. Therefore, the performance and the optimisation schemes utilised for this operator is of major importance for the performance of temporal DBMSs. Insofar, performance studies for various algorithms that implement this operator have been conducted, however, the joint optimisation of the coalesce operator with other algebraic operators that appear in the query execution plan has only received minimal attention. In this paper, we propose a scheme for combining the coalesce operator with selection operators which are applied to the valid time of the tuples produced from a coalescing operation. The proposed scheme aims at reducing the number of tuples that a coalescing operator must process, while at the same time allows the optimiser to exploit temporal indices on the valid time of the data.
Citations
|
521
|
Query evaluation techniques for large databases
– Graefe
- 1993
|
|
500
|
Fundamentals of Database Systems
– Elmasri, Navathe
- 1994
|
|
452
|
The R ∗ -tree: An Efficient and Robust Access Method for Points and Rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
304
|
The temporal query language TQuel
– Snodgrass
- 1984
|
|
303
|
The R+ Tree: A Dynamic Index for Multidimensional Objects
– Sellis, Roussopoulos, et al.
- 1987
|
|
295
|
A bibliography on temporal databases
– Stam, Snodgrass
- 1988
|
|
78
|
A temporally oriented data model
– ARIAV
- 1986
|
|
62
|
et al. A Consensus Glossary of Temporal Database Concepts
– Jensen
- 1998
|
|
47
|
SQL extension for interval data
– Lorentzos, Mitsopoulos
- 1997
|
|
38
|
Temporal Extensions to the Relational Model and SQL
– Navathe, Ahmed
- 1993
|
|
38
|
Tsotras, A Comparison of Access Methods for Temporal Data, TimeCenter
– Salzberg, J
- 1997
|
|
36
|
The interval-extended relational model and its applications to valid-time databases
– Lorentzos
- 1993
|
|
32
|
The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases
– Shen, Ooi, et al.
- 1994
|
|
27
|
The time index and the monotonic B + -tree
– Elmasri, Wuu, et al.
- 1993
|
|
25
|
R-trees: a dynamic index structure for spatial searching
– Guttmann
- 1984
|
|
11
|
The interval B-tree
– Ang, Tan
- 1995
|
|
6
|
TIME-IT: The TIME Integrated Testbed. Pre-beta version 0.1 available via anonymous ftp from ftp.cs.arizona.edu
– Kline, Soo
- 1995
|
|
5
|
Ben-Zvi's Pioneering Work in Relational Temporal Databases, chapter 8
– Gadia
- 1993
|
|
1
|
Coalescing in Temporal Databases”, TimeCenter
– Böhlen, Snodgrass, et al.
- 1997
|
|
1
|
The Historical Relational Data Model (HDRM) Revisited
– Clifford, Croker
- 1993
|
|
1
|
et al. “The Time Index + : An Incremental Access Structure for Temporal Databases
– Kouramajian
- 1994
|
|
1
|
Indexing Valid Time Databases via B + -trees–The MAP21 Approach”, TimeCenter
– Nascimento, Dunham
- 1998
|
