Name
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.
|
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04840-1_20 | Object-Oriented and Entity-Relationship Modelling/International Conference on Conceptual Modeling / the Entity Relationship Approach |
Keywords | Field | DocType |
complex model,time slices,public transport schedule,initial schedule,typical strategy,representation formalism,feasible strategy,realistic schedule,relational model,multislices corresponds,regular pattern,temporal data,public transport | Data mining,Preemption,Computer science,Algorithm,Compact space,Schedule,Temporal database,Formalism (philosophy),Relational model | Conference |
Volume | ISSN | Citations |
5829 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Romans Kasperovics | 1 | 9 | 2.59 |
| Michael H. Böhlen | 2 | 1173 | 179.40 |
| Johann Gamper | 3 | 465 | 54.06 |