Please use this identifier to cite or link to this item:
Title: Indexing bitemporal databases as points
Authors: Ooi, B.C. 
Goh, C.H. 
Tan, K.-L. 
Keywords: Bitemporal databases
Spatial access methods
Transaction time
Valid time
Issue Date: 1998
Citation: Ooi, B.C.,Goh, C.H.,Tan, K.-L. (1998). Indexing bitemporal databases as points. Information and Software Technology 40 (5-6) : 327-337. ScholarBank@NUS Repository.
Abstract: A bitemporal database supports both the valid and transaction time dimensions. Records in such a database can be viewed as a rectangle in a 2-dimensional space (corresponding to the valid and transaction time dimensions). Hence, a spatial access method can be employed to facilitate speedy retrieval of the database. In this paper, we re-examine the issue of designing efficient access methods for bitemporal databases. In particular, we transform a record into a point in a multi-dimensional space, where the valid time and transaction time are each mapped to a 2-dimensional coordinate. A temporal selection operation can then be implemented as a region search operation. This allows us to tap into the many point access methods that are commercially available without modification. We implemented and evaluated three R-tree based methods on key-range time-slice queries: the naive Point R-tree, the Dual Point R-tree and the Dual Spatial R-tree. Our experimental results show that while the simple Point R-tree is inferior to the Dual Spatial R-tree, the Dual Point R-tree has the best performance of the three. © 1998 Elsevier Science B.V.
Source Title: Information and Software Technology
ISSN: 09505849
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Mar 9, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.