Overlapping B+-trees: An implementation of a transaction time access method
Authors:
- Theodoros TzouramanisTTTheodoros Tzouramanis
- Yannis ManolopoulosYMYannis Manolopoulos
- Nikos LorentzosNLNikos Lorentzos
- 31 March 1999
- journal article
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 29 (3) , 381-404
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Designing access methods for bitemporal databasesIEEE Transactions on Knowledge and Data Engineering, 1998
- SQL extension for interval dataIEEE Transactions on Knowledge and Data Engineering, 1997
- An efficient multiversion access structureIEEE Transactions on Knowledge and Data Engineering, 1997
- An asymptotically optimal multiversion B-treeThe VLDB Journal, 1996
- Functional requirements for historical and interval extensions to the relational modelData & Knowledge Engineering, 1995
- The Snapshot Index: An I/O-Optimal access method for timeslice queriesInformation Systems, 1995
- Short Note: Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar FilesThe Computer Journal, 1990
- Temporal DatabasesComputer, 1986
- Key-sequence data sets on indelible storageIBM Journal of Research and Development, 1986
- Multiple Generation Text Files using Overlapping Tree StructuresThe Computer Journal, 1985