Efficient Differential Timeslice Computation (1994)
Cached
Download Links
- [ftp.cc.gatech.edu]
- [www.cs.auc.dk]
- [www.cs.auc.dk]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Transactions on knowledge and data engineering |
| Citations: | 5 - 0 self |
BibTeX
@TECHREPORT{Torp94efficientdifferential,
author = {Kristian Torp and Leo Mark and Christian Jensen and Fredrik Bajers Vej E},
title = {Efficient Differential Timeslice Computation},
institution = {IEEE Transactions on knowledge and data engineering},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Transaction-time databases record all previous database states and are ever-groving, leading to potentially huge quantities of data. For that reason, efficient query processing is of particular importance. Due to the large size of transaction-time relations, it is advantageous to utilize cheap writeonce storage media for storage. This is facilitated by adopting a log-based storage structure. Timeslices, i.e., relation states or snapshots, are computed by traversing the logs, using previously computed and cached timeslices as outsets. When computing a new timeslice, the cache will contain two candidate outsets: an earlier outset and a later outset. We provide efficient means of always picking the optimal one. Specifically, we define and investigate the use of a new data structure, the B+tree-like Insertion Tree (I-tree), for this purpose. The cost of using an I-tree for picking the optimal outset is similar to that of using a B+tree. Being sparse, I-trees require li...
