DSpace Repository

An Efficient Method for Indexing Now-relative Bitemporal Data

Show simple item record

dc.contributor.author Stantic Bela
dc.contributor.author Khanna Sankalp
dc.contributor.author Thornton John
dc.date.accessioned 2018-01-22T17:25:53Z
dc.date.available 2018-01-22T17:25:53Z
dc.date.issued 2003
dc.identifier.uri http://hdl.handle.net/123456789/7022
dc.description.abstract Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much research has focussed on indexing temporal data in general, 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 geometrical features of spatial access methods. Logical query transformation enables off-the-shelf spatial indexes to be used. We empirically demonstrate that this method is efficient on now-relative bitemporal data, out-performing a straightforward maximum-timestamp approach by a factor of more than 20, both in number of disk accesses and CPU usage.
dc.format application/pdf
dc.title An Efficient Method for Indexing Now-relative Bitemporal Data
dc.type generic


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account