Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
1997, Database Systems for Advanced Applications '97 - Proceedings of the Fifth International Conference on Database Systems for Advanced Applications
…
10 pages
1 file
A wide range of database applications manage timevarying data, and it is well-known that querying and correctly updating time-varying data is dificult and error-prone when using standard SQL. Temporal extensions of SQL ofSeer substantial benefits over SQL when managing time-varying data. The topic of this paper is the effective implementation of temporally extended SQL's. Traditionally, it has been assumed that a temporal DBMS must be built from scratch, utilizing new technologies for storage, indexing, query optimization, concurrency control, and recovery. In contrast, this paper explores the concepts and techniques involved in implementing a temporally enhanced SQL while maximally reusing the facilities of an existing SQL implementation. The topics covered span the choice of an adequate timestamp domain that includes the time van'able "NOW," a comparison. of query processing architectures, and transaction processing, the latter including how to ensure ACID properties and assign timestamps to updates.
… of the Fifth International Conference on …, 1997
A wide range of database applications manage time-varying data, and it is wellknown that querying and correctly updating time-varying data is difficult and error-prone when using standard SQL. Temporal extensions of SQL offer substantial benefits over SQL when managing time-varying data.
Database and Expert …, 1996
1994
Abstract In this paper we describe an implementation of a temporal relational database management system based on attribute timestamping. For this purpose we modify an existing software 6] which supports set-valued attributes. The algebraic language of the system includes relational algebra operators, restructuring operators and temporal operators.
Several attempts to incorporate temporal extensions into the Structured Query Language, SQL, one of the most popular query languages for databases date back to the nineteenth and twentieth century. Although a lot of work and research has been done on temporal databases and SQL, there exist very limited literature clearly outlining the various events which have taken place with regards to temporal extensions of SQL over the years till the present state in a concise document. Consequently, researchers need to gather several pieces of literature before they can obtain a vivid pictorial timeline of the history and the current state of these temporal extensions for research and software development purposes.
Business Intelligence and Big Data, 2018
Despite the ubiquity of temporal data and considerable research on the effective and efficient processing of such data, database systems largely remain designed for processing the current state of some modeled reality. More recently, we have seen an increasing interest in the processing of temporal data that captures multiple states of reality. The SQL:2011 standard incorporates some temporal support, and commercial DBMSs have started to offer temporal functionality in a step-by-step manner, such as the representation of temporal intervals, temporal primary and foreign keys, and the support for so-called time-travel queries that enable access to past states. This tutorial gives an overview of state-of-the-art research results and technologies for storing, managing, and processing temporal data in relational database management systems. Following an introduction that offers a historical perspective, we provide an overview of basic temporal database concepts. Then we survey the state-of-the-art in temporal database research, followed by a coverage of the support for temporal data in the current SQL standard and the extent to which the temporal aspects of the standard are supported by existing systems. The tutorial ends by covering a recently proposed framework that provides comprehensive support for processing temporal data and that has been implemented in PostgreSQL.
Sigmod Record, 1994
Temporal databases has been an active area of research for the the last fteen years, with a corpus nearing 800 papers. While most applications need to store time-varying data, there are no widely used commercial temporal databases. A primary reason for the absence of technology transfer from research to practice is the lack of a commonly accepted consensus data model or query language upon which to base research and development. Even the terminology is inconsistent.
Dozens of temporal extension of the relational data model and of the query language SQL have appeared in recent years. Recently, a committee formed by researchers from the academic and the industrial worlds designed a consensual extension of the SQL-92 standard to include time, epitomized as TSQL2.
Recent Advances in …, 1995
Transactions are a significant concept in database systems, facilitating functions both at user and system level. However transaction support in temporal 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, and avoid excessive increment of the log size.
Computing Research Repository, 2011
Many works have focused, for over twenty five years, on the integration of the time dimension in databases (DB). However, the standard SQL3 does not yet allow easy definition, manipulation and querying of temporal DBs. In this paper, we study how we can simplify querying and manipulating temporal facts in SQL3, using a model that integrates time in a native manner. To do this, we propose new keywords and syntax to define different temporal versions for many relational operators and functions used in SQL. It then becomes possible to perform various queries and updates appropriate to temporal facts. We illustrate the use of these proposals on many examples from a real application.
This research try to address several issues related to multiple relations time-stamps temporal databases and the development of temporal databases. A new hash-clustered index structure has been designed to accommodate efficient access for tuples that are indexed on time-stamps. Furthermore, new time intersection equi-join algorithms have been developed. These algorithms have been designed to handle special types of temporal relations, such like continuous and event dependents temporal relations. These algorithms have been implemented and the tests' results prove the correctness of the algorithms.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Lecture Notes in Computer Science, 1991