Multi-dimensional Aggregation for Temporal Data
Business Intelligence solutions, encompassing technologies such as multi-dimensional data modeling and aggregate query processing, are being applied increasingly to non-traditional data. This paper extends multi-dimensional aggregation to apply to data with associated interval values that capture when the data hold. In temporal databases, intervals typically capture the states of reality that the data apply to, or capture when the data are, or were, part of the current database state.
This paper proposes a new aggregation operator that addresses several challenges posed by interval data. First, the intervals to be associated with the result tuples may not be known in advance, but depend on the actual data. Such unknown intervals are accommodated by allowing result groups that are specified only partially. Second, the operator contends with the case where an interval associated with data expresses that the data holds for each point in the interval, as well as the case where the data holds only for the entire interval, but must be adjusted to apply to sub-intervals. The paper reports on an implementation of the new operator and on an empirical study that indicates that the operator scales to large data sets and is competitive with respect to other temporal aggregation algorithms.
KeywordsResult Group Aggregation Operator Temporal Aggregation Constant Interval Aggregate Function
Unable to display preview. Download preview PDF.
- 1.Akinde, M.O., Böhlen, M.H.: The efficient computation of subqueries in complex OLAP queries. In: Proc. of the 19th Intl. Conf. on Data Engineering, Bangalore, India, pp. 163–174 (2003)Google Scholar
- 2.Akinde, M.O., Böhlen, M.H., Johnson, T., Lakshmanan, L.V.S., Srivastava, D.: Efficient OLAP query processing in distributed data warehouses. In: Proc. of the 8th Intl. Conf. on Extending Database Technology, Prague, Czech Republic, pp. 336–353 (2002)Google Scholar
- 3.Chatziantoniou, D., Akinde, M.O., Johnson, T., Kim, S.: MD-join: An operator for complex OLAP. In: Proc. of the 17th Intl. Conf. on Data Engineering, Heidelberg, Germany, pp. 524–533 (2001)Google Scholar
- 4.Kline, N., Snodgrass, R.T.: Computing temporal aggregates. In: Proc. of the 11th Intl. Conf. on Data Engineering, Taipei, Taiwan, pp. 222–231 (1995)Google Scholar
- 7.Zhang, D., Markowetz, A., Tsotras, V., Gunopulos, D., Seeger, B.: Efficient computation of temporal aggregates with range predicates. In: Proc. of the 20th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, Santa Barbara, CA, pp. 237–245 (2001)Google Scholar
- 8.Tuma, P.A.: Implementing Historical Aggregates in TempIS. PhD thesis, Wayne State University, Detroit, Michigan (1992)Google Scholar
- 9.Tao, Y., Papadias, D., Faloutsos, C.: Approximate temporal aggregation. In: Proc. of the 20th Intl. Conf. on Data Engineering, Boston, USA, pp. 190–201 (2004)Google Scholar
- 11.Enderle, J., Hampel, M., Seidl, T.: Joining interval data in relational databases. In: Proc. Of the ACM SIGMOD Intl. Conf. on Knowledge and Data Engineering, Paris, France, pp. 683–694 (2004)Google Scholar