A consensus glossary of temporal database concepts
ACM SIGMOD Record
The TSQL2 Temporal Query Language
The TSQL2 Temporal Query Language
Data Structures and Their Algorithms
Data Structures and Their Algorithms
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
On Effective Data Clustering in Bitemporal Databases
TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
| Hi-index | 0.00 |
Temporal databases introduce the concept of time into underlying data, and provide built-in facilities that allow users to store and retrieve time-varying data. The aggregation in temporal databases, that is, temporal aggregation is an extension of conventional aggregation on the domain and range of aggregates to include time concept. Temporal aggregation is important for various applications, but is very expensive. In this paper, we propose a new tree structure for temporal aggregation, called PA-tree, and aggregate processing method based on the PA-tree. We show that the time complexity of the proposed method is better than those of the existing methods. The time complexity of the proposed method is shown to be indeed the lower bound of the problem. We perform comparative experiments and show the performance advantage of our proposed method in practice.