BibTeX
@TECHREPORT{Salzberg_branchedand,
author = {Betty Salzberg and David Lomet},
title = {Branched and Temporal Index Structures},
institution = {},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we combine the ideas of time-varying data and branching versions to produce and compare two new indexing structures: the BT (Branched and Temporal) Forest and the PBT-Tree (the Persistent Branched and Temporal Tree).
Citations
| 910 | Multidimensional binary search trees used for associative searching - Bentley - 1975 |
| 231 | Making data structures persistent - Driscoll, Sarnak, et al. - 1989 |
| 148 | Comparison of access methods for time-evolving data - Salzberg, Tsotras - 1999 |
| 143 | Two algorithms for maintaining order in a list - Dietz, Sleator - 1987 |
| 122 | Access methods for multiversion data - LOMET, B - 1989 |
| 110 | Object and file management in the EXODUS extensible database system - Carey, DeWitt, et al. - 1986 |
| 44 | The performance of a multiversion access method - LOMET, SALZBERG - 1990 |
| 28 | Key-sequence data sets on indelible storage - EASTON - 1986 |
| 27 | Overlapping B+ Trees for Temporal Data - Manolopoulos, Kapetanakis - 1990 |
| 17 | Fully persistent B + -trees - Lanka, Mays - 1991 |
| 16 | Timestamping after commit - SALZBERG - 1994 |
| 7 | Exploiting a history database for backup - LOMET, SALZBERG - 1993 |
| 6 | A Version Numbering Scheme with a Useful Lexicographical Order - Keller, Ullman - 1995 |
