Database Paper Browser

Back to papers

Query Processing Techniques for Multiversion Access Methods

Summary: Focuses on query processing for multiversion access methods in transaction-time databases with versioned duplicates. Proposes two duplicate-elimination algorithms that avoid extra data structures—depth-first root traversal and inter-page link traversal—with a study vs hashing/sorting showing CPU, I/O, and storage gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8341
Venue
VLDB
Year
1996
Pagerank
4.7037113e-05
Overall Rank
7,585 | 47.24%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
4,737 Joining Interval Data in Relational Databases 2004 SIGMOD 5.9604127e-05
7,208 Efficient Bulk Updates on Multiversion B-trees 2013 VLDB 4.7998295e-05
8,546 I/O-Efficient Planar Range Skyline and Attrition Priority Queues 2013 PODS 4.4937074e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers