Abstract
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.
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.
Similar content being viewed by others
References
Bettini, C., Mascetti, S.: An efficient algorithm for minimizing time granularity periodical representations. In: TIME, pp. 20–25 (2005)
Bettini, C., Sibi, R.D.: Symbolic representation of user-defined time granularities. In: Proceedings of TIME 1999, pp. 17–28. IEEE Computer Society, Los Alamitos (1999)
Chandra, R., Segev, A., Stonebraker, M.: Implementing calendars and temporal rules in next generation databases. In: Proceedings of the Tenth International Conference on Data Engineering, Washington, DC, USA, pp. 264–273. IEEE Computer Society Press, Los Alamitos (1994)
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, Los Alamitos (2004)
Egidi, L., Terenziani, P.: A mathematical framework for the semantics of symbolic languages representing periodic time. In: Proceedings of TIME 2004, IEEE Computer Society, Los Alamitos (2004)
Kabanza, F., Stevenne, J.-M., Wolper, P.: Handling infinite temporal data. In: PODS, pp. 392–403 (1990)
Leban, B., McDonald, D.D., Forster, D.R.: A representation for collections of temporal intervals. In: Proceedings of AAAI 1986, pp. 367–371 (August 1986)
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)
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 periodicy in temporal relational databases. IEEE TKDE 15(2) ( March/April 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kasperovičs, R., Böhlen, M. (2006). Querying Multi-granular Compact Representations. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_10
Download citation
DOI: https://doi.org/10.1007/11733836_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33337-1
Online ISBN: 978-3-540-33338-8
eBook Packages: Computer ScienceComputer Science (R0)