Designing Access Methods for Bitemporal Databases

dc.contributor.authorKumar, Anilen_US
dc.contributor.authorTsotras, Vassilis J.en_US
dc.contributor.authorFaloutsos, Christosen_US
dc.date.accessioned2004-05-31T22:45:19Z
dc.date.available2004-05-31T22:45:19Z
dc.date.created1997-03en_US
dc.date.issued1998-10-15en_US
dc.description.abstractBy supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper we examine the issues involved in designing efficient access methods for bitemporal databases and propose the partial-persistence and the double-tree methodologies. The partial- persistence methodology reduces bitemporal queries to partial persistence problems for which an efficient access method is then designed. The double-tree methodology "sees" each bitemporal data object as consisting of two intervals (a valid-time and a transaction- time interval), and divides objects into two categories according to whether the right endpoint of the transaction time interval is already known. A common characteristic of both methodologies is that they take into account the properties of each time dimension. Their performance is compared with a straightforward approach that "sees" the intervals associated with a bitemporal object as composing one rectangle which is stored in a single multidimensional access method. Given that some limited additional space is available, our experimental results show that the partial- persistence methodology provides the best overall performance, especially for transaction timeslice queries. For those applications that require ready, off-the-shelf, access methods the double-tree methodology is a good alternative. (Also cross-referenced as UMIACS-TR-97-24)en_US
dc.format.extent333081 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/889
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3764en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-97-24en_US
dc.titleDesigning Access Methods for Bitemporal Databasesen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-3764.ps
Size:
325.27 KB
Format:
Postscript Files
Loading...
Thumbnail Image
Name:
CS-TR-3764.pdf
Size:
136.3 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-3764.ps