Please use this identifier to cite or link to this item:
|Title:||Indexing temporal data using existing B+-trees||Authors:||Goh, C.H.
|Issue Date:||Mar-1996||Citation:||Goh, C.H., Lu, H., Ooi, B.-C., Tan, K.-L. (1996-03). Indexing temporal data using existing B+-trees. Data and Knowledge Engineering 18 (2) : 147-165. ScholarBank@NUS Repository. https://doi.org/10.1016/0169-023X(95)00034-P||Abstract:||Research in temporal databases has largely focused on extensions of existing data models for the proper handling of temporal information. One approach is to store temporal data on existing DBMS and build some new indexes to provide support for the efficient retrieval of temporal data. This paper describes mapping strategies to linearize the data such that existing B+-trees can be used directly. With such an implementation, a temporal relation is mapped to points in a multi-dimensional space, with each time interval being translated to a two-dimensional coordinate, and a temporal selection operation is constructed as a spatial search operation. The proposed approach has two advantages. First, mapping a temporal relation to a multi-dimensional space provides a uniform framework for dealing with temporal queries involving transaction and valid time, as well as other non-temporal attributes. Second, linearization of the multi-dimensional search space allows classical indexing methods (such as the B+-tree) to be used; this means that index support for temporal selection can be accomplished without modification to the underlying storage components of the DBMS. Both analytical and simulation study show that the proposed indexing scheme is more efficient than the time index in both its disk utilization and access time.||Source Title:||Data and Knowledge Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/99313||ISSN:||0169023X||DOI:||10.1016/0169-023X(95)00034-P|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.