DBScholar

Back to papers

The Performance Of A Multiversion Access Method

Summary: Time-Split B-tree, an integrated index for a versioned timestamped DB, migrates data to history as nodes split. Analyzes redundancy, space utilization, and insert/update performance across insertion-vs-update mixes; compares three policies (time vs key-space) and two split types. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2561
Venue
SIGMOD
Year
1990
Pagerank
7.8303009e-05
Overall Rank
3,033 | 79.20%
DOI
10.1145/93597.98744

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lomet_sigmod90,
        title = {{THE PERFORMANCE OF A MULTIVERSION ACCESS METHOD}},
        author = {Lomet, David and Salzberg, Betty},
        series = {{SIGMOD} '90},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/93597.98744},
        url = {https://dl.acm.org/doi/10.1145/93597.98744},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
99 The Design of the POSTGRES Storage System 1987 VLDB 0.00034506601
335 A Taxonomy of Time in Databases 1985 SIGMOD 0.00020869676
681 Access Methods For Multiversion Data 1989 SIGMOD 0.0001502579
709 Logical Modeling Of Temporal Data 1987 SIGMOD 0.00014726781
Previous Page 1 / 1 Next

Semantically Similar Papers