A homogeneous relational model and query languages for temporal databases
ACM Transactions on Database Systems (TODS)
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An Algebraic Representation of Calendars
Annals of Mathematics and Artificial Intelligence
Symbolic User-Defined Periodicity in Temporal Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Implementing Calendars and Temporal Rules in Next Generation Databases
Proceedings of the Tenth International Conference on Data Engineering
Symbolic Representation of User-Defined Time Granularities
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
A Mathematical Framework for the Semantics of Symbolic Languages Representing Periodic Time
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
The SOL Time Theory: A Formalization of Structured Temporal Objects and Repetition
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Recursive Representation of Periodicity and Temporal Reasoning
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Representation of periodic moving objects in databases
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science
Querying multi-granular compact representations
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
On the efficient construction of multislices from recurrences
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Hi-index | 0.00 |
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.