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
An Efficient Algorithm for Minimizing Time Granularity Periodical Representations
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Evaluating Exceptions on Time Slices
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
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 |
A common phenomenon of time-qualified data are temporal repetitions, i.e., the association of multiple time values with the same data. In order to deal with finite and infinite temporal repetitions in databases we must use compact representations. There have been many compact representations proposed, however, not all of them are equally efficient for query evaluation. In order to show it, we define a class of simple queries on compact representations. We compare a query evaluation time on our proposed multi-granular compact representation GSequences with a query evaluation time on single-granular compact representation PSets, based on periodical sets. We show experimentally how the performance of query evaluation can benefit from the compactness of a representation and from a special structure of GSequences.