EFFICIENT TIMESTAMP INPUT AND OUTPUT

被引:1
作者
DYRESON, CE
SNODGRASS, RT
机构
[1] Department of Computer Science, University of Arizona, Tucson, Arizona
关键词
CALENDARS; GREGORIAN CALENDAR; TIMESTAMP; INPUT; OUTPUT;
D O I
10.1002/spe.4380240106
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we provide efficient algorithms for converting between timestamp values that signify some number of seconds from an arbitrary origin, and character strings specifying Gregorian dates, such as 'January 1, 1993'. We give several algorithms that explore a range of time and space trade-offs. Unlike previous algorithms, those discussed here have a constant time cost over a greatly extended range of timestamp values. These algorithms are especially useful in operating systems and in database management systems.
引用
收藏
页码:89 / 109
页数:21
相关论文
共 10 条
[1]  
ALLEN JF, 1981, 7TH P INT JOINT C AR, P221
[2]  
Aveni A.F., 1989, EMPIRES TIME CALENDA
[3]   CALENDRICAL CALCULATIONS [J].
DERSHOWITZ, N ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1990, 20 (09) :899-928
[4]   TIMESTAMP SEMANTICS AND REPRESENTATION [J].
DYRESON, CE ;
SNODGRASS, RT .
INFORMATION SYSTEMS, 1993, 18 (03) :143-166
[5]  
FRASER JT, 1987, TIME FAMILIAR STRANG
[6]  
Liskov B, 1986, ABSTRACTION SPECIFIC
[7]   CALENDRICAL CALCULATIONS .2. 3 HISTORICAL CALENDARS [J].
REINGOLD, EM ;
DERSHOWITZ, N ;
CLAMEN, SM .
SOFTWARE-PRACTICE & EXPERIENCE, 1993, 23 (04) :383-404
[8]  
SOO M, 1992, 32 U AR COMP SCI DEP
[9]  
SOO M, 1992, 29 U AR COMP SCI DEP
[10]  
TANSEL AU, 1992, TEMPORAL RELATIONAL