Abstract
This paper uses an algebraic approach to define temporal granularities and calendars. All the granularities in a calendar are expressed as algebraic expressions based on a single “bottom” granularity. The operations used in the algebra directly reflect the ways with which people construct new granularities from existing ones, and hence yield more natural and compact granularities definitions. Calendar is formalized on the basis of the algebraic operations, and properties of calendars are studied. As a step towards practical applications, the paper also presents algorithms for granule conversions between granularities in a calendar.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Bettini, C.E. Dyreson, W.S. Evans, R.R. Snodgrass and X. S. Wang, Temporal databases: research and practice, in: Lecture Notes in Computer Science, Vol. 1399 (Springer, 1998) chapter "A glossary of time granularity concepts".
C. Bettini, S. Jajodia and X.S. Wang, Time Granularities in Databases, Data Mining, and Temporal Reasoning (Springer, 2000).
C. Bettini and R.D. Sibi, Symbolic representation of user-defined time granularities, in: Proc. of 6th Int'l Workshop on Temporal Representation and Reasoning (1999) pp. 17-28.
C. Bettini, X.S. Wang and S. Jajodia, A general framework for time granularity and its application to temporal reasoning, Annals of Mathematics and Artificial Intelligence 22(1-2) (1998) 29-58.
R. Chandra, A. Segev and M. Stonebraker, Implementing calendars and temporal rules in next generation databases, in: Proceedings of ICDE (1994) pp. 264-273.
J. Clifford and A. Rao, A simple, general structure for temporal domains, in: Proc. of the Conference on Temporal Aspects in Information Systems (1987) pp. 23-30.
T. Dean, Using temporal hierarchies to efficiently maintain large temporal databases, Journal of ACM 36 (1989) 687-718.
C.E. Dyreson, W.S. Evans, H. Lin and R.T. Snodgrass, Efficiently supporting temporal granularities, IEEE Transactions on Knowledge and Data Engineering 12(4) (2000) 568-587.
I.A. Goralwalla, Y. Leontiev, Özsu, D. Szafron and C. Combi, Temporal granularity for unanchored temporal data, in: Proc. of the 1998 ACM CIKM Internat. Conference on Information and Knowledge Management (1998) pp. 414-423.
B. Leban, D. McDonald and D. Foster, A representation for collections of temporal intervals, in: Proceedings of AAAI (1986) pp. 367-371.
J.Y. Lee, E. Ramez and J. Won, Specification of calendars and time series for temporal databases, in: Int'l Conf. on the Entity Relationship Approach (1996) pp. 341-356.
H. Lin, Efficient conversion between temporal granularities, Technical report 19, Time Center (1997).
N.A. Lorentzos, DBMS support for time and totally ordered compound data types, Information Systems 17(5) (1992) 347-358.
N.A. Lorentzos, DBMS support for nonmetric measurement systems, IEEE Transactions on Knowledge and Data Engineering 6(6) (1994) 945-953.
A. Montanari, E. Maim, E. Ciapessoni and E. Ratto, Dealing with time granularity in the event calculus, in: Proc. of the Internat. Conference on Fifth Generation Computer Systems, Tokyo, Japan (1992) pp. 702-712.
M. Niezette and J. Stevenne, An efficient symbolic representation of periodic time, in: Proceedings of CIKM (1992) pp. 161-168.
D.F. Skoll, Remind calendar program, available at http://www.roaringpenguin.com/remind.html.
R.T. Snodgrass (ed.), The TSQL2 Temporal Query Language (Kluwer Academic, Dordrecht, 1995).
J. Wijsen, A string-based model for infinite granularities, in: AAAI-2000 Workshop on Spatial and Temporal Granularities (2000) pp. 9-16.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ning, P., Wang, X.S. & Jajodia, S. An Algebraic Representation of Calendars. Annals of Mathematics and Artificial Intelligence 36, 5–38 (2002). https://doi.org/10.1023/A:1015835418881
Issue Date:
DOI: https://doi.org/10.1023/A:1015835418881