UZH-Logo

Maintenance Infos

Evaluating Exceptions on Time Slices


Kasperovics, Romans; Böhlen, Michael H; Gamper, Johann (2009). Evaluating Exceptions on Time Slices. In: ER 2009: 28th International Conference on Conceptual Modeling, Gramado, Brazil, 9 November 2009 - 12 November 2009, 251-264.

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.

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.

Citations

1 citation in Web of Science®
1 citation in Scopus®
Google Scholar™

Altmetrics

Downloads

1 download since deposited on 01 Jun 2012
0 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Paper), refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
Dewey Decimal Classification:000 Computer science, knowledge & systems
Language:English
Event End Date:12 November 2009
Deposited On:01 Jun 2012 15:40
Last Modified:05 Apr 2016 15:26
Publisher:Springer
Series Name:Lecture Notes in Computer Science
Number:5829/2009
Publisher DOI:https://doi.org/10.1007/978-3-642-04840-1_20
Other Identification Number:merlin-id:2295
Permanent URL: https://doi.org/10.5167/uzh-56223

Download

[img]
Content: Published Version
Filetype: PDF - Registered users only
Size: 170kB
View at publisher

TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.

Author Collaborations