Abstract
Public transport schedules contain temporal data with many regular patterns that can be represented compactly. Exceptions come as modifications of the initial schedule and break the regular patterns increasing the size of the representation. A typical strategy to preserve the compactness of schedules is to keep exceptions separately. This, however, complicates the automated processing of schedules and imposes a more complex model on applications. In this paper we evaluate exceptions by incorporating them into the patterns that define schedules. We employ sets of time slices, termed multislices, as a representation formalism for schedules and exceptions. The difference of multislices corresponds to the evaluation of exceptions and produces an updated schedule in terms of a multislice. We propose a relational model for multislices, provide an algorithm for efficient evaluating the difference of multislices, and show analytically and experimentally that the evaluation of exceptions is a feasible strategy for realistic schedules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kabanza, F., Stevenne, J.-M., Wolper, P.: Handling infinite temporal data. In: PODS, pp. 392–403 (1990)
Behr, T., de Almeida, V.T., Güting, R.H.: Representation of periodic moving objects in databases. In: Proceedings of the 14th International Workshop on Geographic Information Systems, ACM-GIS (2006)
Niezette, M., Stevenne, J.-M.: An efficient symbolic representation of periodic time. In: Proceedings of the First International Conference on Information and Knowledge Management (November 1992)
Leban, B., McDonald, D.D., Forster, D.R.: A representation for collections of temporal intervals. In: Proceedings of AAAI 1986, pp. 367–371 (Augest 1986)
Chandra, R., Segev, A., Stonebraker, M.: Implementing calendars and temporal rules in next generation databases. In: Proceedings of ICDE 1994, Washington, DC, USA, pp. 264–273. IEEE Computer Society, Los Alamitos (1994)
Bettini, C., de Sibi, R.: Symbolic representation of user-defined time granularities. In: TIME, pp. 17–28 (1999)
Ning, P., Wang, X.S., Jajodia, S.: An algebraic representation of calendars. Ann. Math. Artif. Intell 36(1-2), 5–38 (2002)
Terenziani, P.: Symbolic user-defined periodicity in temporal relational databases. IEEE Trans. Knowl. Data Eng. 15(2), 489–509 (2003)
Egidi, L., Terenziani, P.: A mathematical framework for the semantics of symbolic languages representing periodic time. In: TIME, pp. 21–27 (2004)
Kasperovičs, R., Böhlen, M.H.: Querying multi-granular compact representations. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 111–124. Springer, Heidelberg (2006)
Ohlbach, H.J.: Periodic temporal notions as tree partitionings. Forschungsbericht/research report PMS-FB-2006-11, Institute for Informatics, University of Munich (2006)
Cukierman, D.R., Delgrande, J.P.: The sol theory: A formalization of structured temporal objects and repetition. In: Proceedings of TIME 2004. IEEE Computer Society Press, Los Alamitos (2004)
Anselma, L.: Recursive representation of periodicity and temporal reasoning. In: TIME, pp. 52–59 (2004)
Dawson, F., Stenerson, D.: Internet calendaring and scheduling core object specification, icalendar (1998)
Skoll, D.K.: Remind tool manual (2000)
Lago, U.D., Montanari, A., Puppis, G.: Compact and tractable automaton-based representations of time granularities. Theor. Comput. Sci 373(1-2), 115–141 (2007)
Gadia, S.K.: A homogeneous relational model and query languages for temporal databases. ACM Trans. Database Syst. 13(4), 418–448 (1988)
Google Inc.: Google Transit Feed Specification (Febuary 2008)
Weber, C., Brauer, D., Kolmorgen, V., Hirschel, M., Provezza, S., Hulsch, T.: Fahrplanbearbeitungssystem FBS – Anleitung. iRFP (September 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kasperovics, R., Böhlen, M.H., Gamper, J. (2009). Evaluating Exceptions on Time Slices. In: Laender, A.H.F., Castano, S., Dayal, U., Casati, F., de Oliveira, J.P.M. (eds) Conceptual Modeling - ER 2009. ER 2009. Lecture Notes in Computer Science, vol 5829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04840-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-04840-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04839-5
Online ISBN: 978-3-642-04840-1
eBook Packages: Computer ScienceComputer Science (R0)