This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Symbolic User-Defined Periodicity in Temporal Relational Databases
March/April 2003 (vol. 15 no. 2)
pp. 489-509

Abstract—Calendars and periodicity play a fundamental role in many applications. Recently, some commercial databases started to support user-defined periodicity in the queries in order to provide “a human-friendly way of handling time” (see, e.g., TimeSeries in Oracle 8). On the other hand, only few relational data models support user-defined periodicity in the data, mostly using “mathematical” expressions to represent periodicity. In this paper, we propose a high-level “symbolic” language for representing user-defined periodicity which seems to us more human-oriented than mathematical ones, and we use the domain of Gadia's temporal elements in order to define its properties and its extensional semantics. We then propose a temporal relational model which supports user-defined “symbolicperiodicity (e.g., to express “on the second Monday of each month”) in the validity time of tuples and also copes with frame times (e.g., “from 1/1/98 to 28/2/98”). We define the temporal counterpart of the standard operators of the relational algebra, and we introduce new temporal operators and functions. We also prove that our temporal algebra is a consistent extension of the classical (atemporal) one. Moreover, we define both a fully symbolic evaluation method for the operators on the periodicities in the validity times of tuples, which is correct but not complete, and semisymbolic one, which is correct and complete, and study their computational complexity.

[1] M. Abadi and Z. Manna, “Temporal Logic Programming,” J. Symbolic Computation, vol. 8, no. 3, pp. 277-295, Sept. 1989.
[2] S. Adali, L. Console, M.L. Sapino, M. Schenone, and P. Terenziani, “Representing and Reasoning with Temporal Constraints in Multimedia Presentations,” Proc. Seventh Int'l Workshop Temporal Representation and Reasoning (TIME'00), pp. 3-12, 2000.
[3] J.F. Allen, “Maintaining Knowledge about Temporal Intervals,” Comm. ACM, vol. 26, no. 11, pp. 832–843, 1983.
[4] M. Baudinet,M. Niézette, and P. Wolper,"On the representation of infinite temporal data and queries (extended abstract)," Proc. ACM Symp. Principles of Database Systems, pp. 280-290,Denver, May 1991.
[5] M. Baudinet, J. Chomicki, and P. Wolper, “Temporal Databases: Beyond Finite Extensions,” Proc. Int'l Workshop Infrastructure for Temporal Databases, June 1993.
[6] M. Baudinet, J. Chomicki, and P. Wolper, “Temporal Deductive Databases,” Temporal Databases, A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev and R. Snodgrass, eds., 1993.
[7] E. Bertino, C. Bettini, E. Ferrari, and P. Samarati, “An Access Contro Model Supporting Periodicity Constraints and Temporal Reasoning,” ACM Trans. Database Systems, vol. 23, no. 3, pp. 231-285, 1998.
[8] C. Bettini, C. Dyreson, W. Evans, R. Snodgrass, and X. Wang, “A Glossary of Time Granularity Concepts,” Temporal Databases: Research and Practice, 1998.
[9] C. Bettini and R. De Sibi, “Symbolic Representation of User-Defined Time Granularities,” Proc. Sixth Int'l Workshop Temporal Representation and Reasoning (TIME'99), pp. 17-28, 1999.
[10] V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “Extending Temporal Relational Databases to Deal with Imprecise and Qualitative Temporal Information,” J. Clifford and A. Tuzhilin, eds., Recent Advances of Temporal Databases, pp. 3-22, 1995.
[11] V. Brusoni, L. Console, and P. Terenziani, “On the Computational Complexity of Querying Bounds on Differences Constraints,” Artificial Intelligence, vol. 74, no. 2, pp. 367-379, 1995.
[12] V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “LaTeR: An Efficient, General-Purpose Manager of Temporal Information,” IEEE Expert, vol. 12, no. 4, pp. 56-64, 1997.
[13] V. Brusoni, L. Console, B. Pernici, and P. Terenziani, “Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 6, pp. 948-968, Nov./Dec. 1999.
[14] R. Chandra, A. Segev, and M. Stonebraker, “Implementing Calendars and Temporal Rules in Next Generation Databases,” Proc. Int'l Conf. Data Eng., pp. 264-273, 1994.
[15] J. Chomicki and T. Imielinsky, “Temporal Deductive Databases and Infinite Objects,” Proc. Seventh ACM Symp. Principles of Database Systems, pp. 61-73, Mar. 1988.
[16] J. Chomicki and T. Imielinsky, “Finite Representation of Infinite Query Answers,” ACM Trans. Database Systems, vol. 18, no. 2, pp. 181-223, June 1993.
[17] D. Cukierman and J. Delgrande, “Expressing Time Intervals and Repetition within a Formalization of Calendars,” Computational Intelligence, vol. 14, no. 4, pp. 563-597, 1998.
[18] C.E. Dyreson, W.S. Evans, H. Lin, and R.T. Snodgrass, “Efficiently Supporting Temporal Granularities,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 4, pp. 568-587, 2000.
[19] H. Enderton, A Mathematical Introduction to Logic. New York: Academic Press, 1972.
[20] S.K. Gadia, "A Homogeneous Relational Model and Query Languages for Temporal Databases," ACM Trans. Database Systems, vol. 13, no. 4, pp. 418-448, Dec. 1988.
[21] T. Imielinski, “Data on Air—What's in It for the Database Theorist,” Proc. Conf. Database Theory, pp. 1-13, 1995.
[22] F. Kabanza, J.-M. Stevenne, and P. Wolper, “Handling Infinite Temporal Data,” Proc. ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 392-403, Apr. 1990.
[23] F. Kabanza, J.-M. Stevenne, and P. Wolper, “Handling Infinite Temporal Data,” J. Computer and System Sciences, vol. 51, pp. 3-17, 1995.
[24] A. Kurt and M. Ozsoyoglu, “Modelling and Querying Periodic Temporal Databases,” Proc. Workshop Sixth Int'l Conf. Database and Expert Systems Applications (DEXA), pp. 124-133, 1995.
[25] P. Ladkin, “Primitive and Units for Time Specification,” Proc. Fifth Nat'l Conf. Artificial Intelligence, pp. 354-359, Aug. 1986.
[26] P. Ladkin, “Time Representation: A Taxonomy of Interval Relations,” Proc. Fifth Nat'l Conf. Artificial Intelligence, pp. 360-366, Aug. 1986.
[27] B. Leban, D.D. McDonald, and D.R. Forster, “A Representation for Collections of Temporal Intervals,” Proc. Fifth Nat'l Conf. Artificial Intelligence, pp. 367-371, Aug. 1986.
[28] G. Ligozat, “On Generalized Interval Calculi,” Proc. Ninth Nat'l Conf. Artificial Intelligence, pp. 234-240, July 1991.
[29] N.A. Lorentzos and R.G. Johnson, "Extending Relational Algebra to Manipulate Temporal Data," Information Systems, vol. 13, no. 3, pp. 289-296, 1988.
[30] Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.
[31] E. McKenzie and R. Snodgrass, “Schema Evolution and the Relational Algebra,” Information Systems, vol. 15, no. 2, pp. 207-232, 1990.
[32] L.E. McKenzie, Jr. and R.T. Snodgrass, “Evaluation of Relational Algebras Incorporating the Time Dimension in Databases,” ACM Computing Surveys, vol. 23, no. 4, pp. 501–543, 1991.
[33] R.A. Morris, W.D. Shoaff, and L. Khatib, “Domain Independent Temporal Reasoning with Recurring Events,” Computational Intelligence, vol. 12, no. 3, pp. 450-477, 1996.
[34] M. Niezette and J.-M. Stevenne, “An Efficient Symbolic Representation of Periodic Time,” Proc. First Int'l Conf. Information and Knowledge Management, Nov. 1992.
[35] The TSQL2 Temporal Query Language. R.T. Snodgrass, ed., Kluwer Academic Publishers, 1995.
[36] R.T. Snodgrass and I. Ahn, "Temporal Databases," Computer, vol. 19, no. 9, pp. 35-42, Sept. 1986.
[37] R.T. Snodgrass, M.H. Bohlen, C.S. Jensen, and A. Steiner, “Transitioning Temporal Support in TSQL2 to SQL3,” Temporal Databases—Research and Practice, O. Etzion, S. Jajodia, S. Sripada eds., pp. 150-191, 1998.
[38] M. Soo and R. Snodgrass, “Multiple Calendar Support for Conventional Database Management Systems,” Proc. Int'l Workshop an Infrastructure for Temporal Databases, June 1993.
[39] Temporal Databases: Theory, Design and Implementation. A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, eds., Benjamin/Cummings, 1993.
[40] P. Terenziani, “Integrating Calendar-Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 5, pp. 763-783, 1997.
[41] P. Terenziani, “Symbolic User-defined Periodicity in Temporal Relational DataBases, version II,” Technical Report RT58-00, Dipartimento di Informatica, Univ. di Torino,http://www.di.unito.it/~terenzTECH-REP/, 2000.
[42] P. Terenziani, “Is Point-Based Semantics Always Adequate for Temporal Databases?” Proc. Seventh Int'l Workshop Temporal Representation and Reasoning (TIME'00), pp. 191-199, 2000.
[43] P. Terenziani and P. Terenziani, “Integrated Temporal Reasoning with Periodic Events,” Computational Intelligence, vol. 16, no. 2, pp. 210-256, May 2000.
[44] P. Terenziani and R.T. Snodgrass, “Reconciling Point-Based and Interval-Based Semantics in Temporal Relational Databases: A Proper Treatment of the Telic/Atelic Distinction,” Technical Report TR-60, TIMECENTER, June 2001.
[45] D. Toman, J. Chomicki, and D. Rogers, “Datalog with Integer Periodicity Constraints,” Proc. Int'l Logic Programming Symp., pp. 189-203, 1994.
[46] A. Tuzhilin and J. Clifford, “On Periodicity in Temporal Databases,” Information Systems, vol. 20, no. 8, pp. 619-639, Dec. 1995.
[47] F. Van Eynde, “Iteration, Habituality and Verb Form Semantics,” Proc. Third Conf. European Chapter of the Assoc. for Computational Linguistics, pp. 270-277, Apr. 1987.
[48] M.Y. Vardi, “A Temporal Fixpoint Calculus,” Proc. 15th Ann. ACM SIGACT-SIGPLAN Symp. Principles of Programming Languages, pp. 250-259, 1988.
[49] X. Wang, C. Bettini, A. Brodsky, and S. Jajodia, "Logical Design for Temporal Databases with Multiple Granularities," ACM Trans. Database Systems, to appear, 1997.
[50] P. Wolper, “Temporal Logic Can be More Expressive,” Information and Control vol. 56, pp. 72-99, 1983.

Index Terms:
Temporal relational model and algebra, user-defined symbolic periodicity in the validity time, high-level “symbolic” language, symbolic (intensional) evaluation method, semisymbolic evaluation method, user-friendly treatment of periodicity, integration and extension of artificial intelligence and temporal databases techniques.
Citation:
Paolo Terenziani, "Symbolic User-Defined Periodicity in Temporal Relational Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 2, pp. 489-509, March-April 2003, doi:10.1109/TKDE.2003.1185847
Usage of this product signifies your acceptance of the Terms of Use.