Title:
Efficient Differential Timeslice Computation
Efficient Differential Timeslice Computation
| dc.contributor.author | Torp, Kristian | en_US |
| dc.contributor.author | Mark, Leo | |
| dc.contributor.author | Jensen, Christian S. | |
| dc.date.accessioned | 2005-06-17T17:57:57Z | |
| dc.date.available | 2005-06-17T17:57:57Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | Transaction-time databases record all previous database states and are ever-growing, 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 write-once 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 little space overhead, and they are cheap to maintain as the underlying relations are updated. I-trees also provide a basis for precisely and efficiently estimating the costs of performing timeslices in advance. This is useful for query optimization and can be essential in real-time applications. Finally, it is demonstrated how I-trees can be used in the computation of other types of queries. | en_US |
| dc.format.extent | 269758 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/6714 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.relation.ispartofseries | CC Technical Report; GIT-CC-94-12 | en_US |
| dc.subject | Transaction time | |
| dc.subject | Data models | |
| dc.subject | Snapshots | |
| dc.subject | Timeslice | |
| dc.subject | Indexing | |
| dc.subject | Incremental computation | |
| dc.title | Efficient Differential Timeslice Computation | en_US |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | College of Computing | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 |
Files
Original bundle
1 - 1 of 1