An Efficient Method for Indexing Now-relative Bitemporal data
نویسندگان
چکیده
Most modern database applications involve a significant amount of time dependent data and a substantial proportion of this data is now-relative, current now. While a lot of work has focussed on indexing on temporal data in general, only a little work has addressed the indexing of now-relative data, which is a natural and meaningful part of every temporal database as well as being the focus of most queries. This paper proposes a logical query transformation that relies on the POINT representation of current time and the geometry features of spatial access methods. Logical query transformation enables off-theshelf Spatial indexes to be used. We empirically prove that this method is very efficient on now-relative Bitemporal data, outperforming the straightforward maximum-timestamp approach by over a factor of 20, both in number of Disk accesses and CPU
منابع مشابه
R-Tree Based Indexing of Now-Relative Bitemporal Data
The databases of a wide range of applications, e.g., in data warehousing, store multiple states of time-evolving data. These databases contain a substantial part of now-relative data: data that became valid at some past time and remains valid until the current time. More specifically, two temporal aspects of data are frequently of interest, namely valid time, when data is true, and transaction ...
متن کاملLight-Weight Indexing of General Bitemporal Data
Most data managed by existing, real-world database applications is time referenced. Data warehouses are good examples. Often, two temporal aspects of data are of interest, namely valid time, when data is true in the mini-world, and transaction time, when data is current in the database, resulting in so-called bitemporal data. Like spatial data, bitemporal data thus has associated two-dimensiona...
متن کاملA Proposal for Indexing Bitemporal Databases via Cooperative B+-trees
In this paper we propose an indexing structure for bitemporal databases. Such structure is based on two trees, one indexing valid time and another indexing transaction time. The trees share pointers to the actual data records, which are thus not duplicated. Bitemporal queries are processed by dividing the query in two parts, a valid time part and a transaction time part. Each tree is searched a...
متن کاملA Split Operator for Now-Relative Bitemporal Databases
The timestamps of now-relative bitemporal databases are modeled as growing, shrinking, or rectangular regions. The shape of these regions makes it a challenge to design bitemporal operators that a) are consistent with the pointbased interpretation of a temporal database, b) preserve the identity of the argument timestamps, c) ensure locality, and d) perform efficiently. We identify the bitempor...
متن کاملAn Incremental Index for Bitemporal Databases
Bitemporal databases record not only the history of tuples in temporal tables, but also record the history of the databases themselves. Indexing structures, which are a critical issue in traditional databases, became even more critical for bitemporal databases. We address this problem by investigating an incremental indexing structure based on R-trees, called the HR-tree, which was originally a...
متن کامل