The performance of a multiversion access method

ACM SIGMOD Record

Volumn 19, Issue 2, 1990, Pages 353-363

  Lomet, David ^a   Salzberg, Betty ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE, DIGITAL; INFORMATION SCIENCE - INDEXING; MATHEMATICAL TECHNIQUES - TREES; REDUNDANCY;

B TREES; MULTIVERSION ACCESS METHODS;

DATABASE SYSTEMS;

EID: 0025444581     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/93605.98744     Document Type: Article

References (9)

1. Ahn, I and Snodgrass, R, “Partitioned Storage for Temporal Databases,” Information Systems, 13, 4, 1988 pp 369-391
2. Easton, M, “Key-Sequence Data Sets on Indelible Storage,” IBM J Res Develop, 30:3, May 1986, pp 230-241
3. Eisenbarth, B, Ziviani, N, Gonnet, G, Mehlhorn, K and Wood, D, “The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees,” Inform Contr, 55, 1982, pp 125-174
4. Jensen, C S, Mark, L, and Roussopoulos, N, “Incremental Implementation Model for Relational Databases with Transaction Time,” University of Maryland UMIACS-TR-89-63 CS-TR-2275 July, 1989
5. Lomet, D and Salzberg, B, “Access Methods for Multiversion Data,” Proc ACM SIGMOD, Portland, 1989, pp 315-324
6. McKenzie, E, “Bibliography Temporal Databases,” SIGMOD Record, 15 2, Dec 1986, pp 40-52
7. Segev, A and Shoshani, A, “Logical Modeling of Temporal Data,” Proc ACM SIGMOD, May 1987, pp 454-466
8. Snodgrass, R, and Ahn, I, “A Taxonomy of Time in Databases,” Proc ACM SIGMOD, March 1985, pp 236-246
9. Stonebraker, M, “The Design of the POSTGRES Storage System,” Proc 13th VLDB Conference, Brighton, 1987, pp 289-300