C. E. Dyreson, W. S. Evans, H. Lin, and R. T. Snodgrass, "Efficiently Supporting Temporal Granularities," IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 4, pp. 568-587, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A String-based Model for Infinite Granularities (Extended Abstract) - Wijsen (1999) (Correct)
....intersection, and the intersection of two granularities coincides with the infimum. The supremum does not coincide with union, however; the set of all granularities is not closed for union. The lattice of granularities is infinite. Other studies often assume a finite partial order of granularities (Dyreson et al. 1998), corresponding to real life calendars. Granspecs A granspec is an ordered pair of finite strings over the alphabet f ; t; og, the first string representing the offset, and the second the repeating pattern. Every granspec defines an infinite string. Formally, the relation between granspecs and ....
Dyreson, C. E.; Evans, W. S.; Lin, H.; and Snodgrass, R. T. 1998. Efficiently supporting temporal granularities.
Supporting User-defined Granularities and.. - Supporting.. Self-citation (Dyreson Snodgrass) (Correct)
No context found.
C. E. Dyreson, W. S. Evans, H. Lin, and R. T. Snodgrass, "Efficiently Supporting Temporal Granularities," IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 4, pp. 568-587, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC