Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

An Efficient Method for Indexing Now-relative Bitemporal data

Stantic, B., Khanna, S. and Thornton, J.

    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, outperforming a straightforward maximum-timestamp approach by a factor of more than 20, both in number of disk accesses and CPU usage.
Cite as: Stantic, B., Khanna, S. and Thornton, J. (2004). An Efficient Method for Indexing Now-relative Bitemporal data. In Proc. Fifteenth Australasian Database Conference (ADC2004), Dunedin, New Zealand. CRPIT, 27. Schewe, K.-D. and Williams, H. E., Eds. ACS. 113-122.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007