Titlebook: Recent Advances in Temporal Databases; Proceedings of the I James Clifford,Alexander Tuzhilin Conference proceedings 1995 British Computer

構(gòu)想

FIN

Using Temporal Constructs in Temporal Databases on this language. It is now appropriate to review the power and relevance of this approach. It is accepted that TSQL2 is appropriate for a number of types of temporal query. This paper examines TSQL2 with respect to the requirements of an application area to see how well it can be applied to solvin

cocoon

對(duì)待

Time is just another attribute — or at least, just another dimensioned database design tools such as the relational model are unsatisfactory for the development of database systems in which attribute values change over time. Such writers urge that valid time — the interval over which a data item is valid — be treated differently from time which is an ordinary attrib

礦石

arboretum

Time Series, a Neglected Issue in Temporal Database Research?series can be easily handled by temporal database management systems. In this paper, we take a different position. Time series management has special requirements concerning structural and functional aspects, time model, calendar system and query facilities. Temporal database management systems do n

進(jìn)步

Access Methods for Bi-Temporal Databasesatabases, i. e., databases that incorporate both transaction and valid time dimensions. In this paper we first discuss the issues involved in addressing general bitemporal queries and then propose two general approaches in solving such queries. For simplicity we present our findings in relation to t

WAG

Transaction Support in a Temporal DBMSral DBMSs has not yet received enough research attention. In this paper, we present techniques for incorporating transaction support in a temporal DBMS, which is implemented as an additional layer to a commercial RDBMS. These techniques overcome certain limitations imposed by the underlying RDBMS, a

托人看管

激勵(lì)

Temporal connectives versus explicit timestamps in temporal query languages compare augmentations of these languages with temporal left and right moves on the one hand, and with explicit timestamps on the other hand. For example, we show that a version of fixpoint logic with left and right moves lies between the explicit timestamp versions of first-order and fixpoint logic, respectively