On query optimization in a temporal SPC algebra
✍ Scribed by Jef Wijsen; Alexis Bès
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 373 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0169-023X
No coin nor oath required. For personal study only.
✦ Synopsis
Tuples of a temporal relation are equipped with a valid time period. A simple extension of the selectionprojection-cross product (SPC) algebra for temporal relations is defined, which conforms to primitives in existing temporal query languages. In particular, temporal projection involves coalescing of time intervals, which results in non-monotonic queries. Also the ''select-from-where'' normal form is no longer available in this temporal extension. In view of these temporal peculiarities, it is natural and significant to ask whether query optimization techniques for the SPC algebra still apply in the temporal case. To this extent, we provide a temporal extension of the classical tableau formalism, and show its use and limits for temporal query optimization.
📜 SIMILAR VOLUMES
Dimensions are usually considered static in a data warehouse. However, because of changing requirements, dimension data and dimension structure can evolve. In this paper we focus on a type of dimension data change called reclassification, i.e., when a member of a level changes its parent in a higher