Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
Summary: Introduces LHAM, a log-structured transaction-time access method that partitions versions into timestamped components and migrates them across storage tiers. Its implementation delivers much higher insert throughput than TSB-trees with comparable or superior time-travel query performance. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Peter Muth (Saarland University)
- 2. Patrick O'Neil (University of Massachusetts Boston)
- 3. Achim Pick (Saarland University)
- 4. Gerhard Weikum (Saarland University)
BibTeX Citation
@article{muth_vldb98,
title = {{Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method}},
author = {Muth, Peter and O'Neil, Patrick and Pick, Achim and Weikum, Gerhard},
journal = {PVLDB},
series = {{VLDB} '98},
pages = {452--463},
year = {1998}
}Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0020210012 |
| 336 | THE 5 MINUTE RULE FOR TRADING MEMORY FOR DISC ACCESSES and THE 10 BYTE RULE FOR TRADING MEMORY FOR CPU TIME | 1987 | SIGMOD | 0.00020845451 |
| 681 | Access Methods For Multiversion Data | 1989 | SIGMOD | 0.0001502579 |
| 981 | Incremental Organization for Data Recording and Warehousing | 1997 | VLDB | 0.0001284025 |
| 1,501 | Key Range Locking Strategies for Improved Concurrency | 1993 | VLDB | 0.00010559899 |
| 1,901 | A Generic Approach to Bulk Loading Multidimensional Index Structures | 1997 | VLDB | 9.5068846e-05 |
| 2,227 | Concurrency and Recovery in Generalized Search Trees | 1997 | SIGMOD | 8.9111106e-05 |
| 3,033 | The Performance Of A Multiversion Access Method | 1990 | SIGMOD | 7.8303009e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 219 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB |
| 2 | 13,004 | Index Concurrency Control in Firm Real-Time DBMS | 1995 | VLDB |
| 3 | 5,229 | Dissecting, Designing, and Optimizing LSM-based Data Stores | 2022 | SIGMOD |
| 4 | 2,805 | LogBase: A Scalable Log-structured Database System in the Cloud | 2012 | VLDB |
| 5 | 7,459 | Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems | 2019 | VLDB |
| 6 | 8,207 | The HV-tree: a Memory Hierarchy Aware Version Index | 2010 | VLDB |
| 7 | 3,660 | The BT-Tree: A Branched and Temporal Access Method | 2000 | VLDB |
| 8 | 3,033 | The Performance Of A Multiversion Access Method | 1990 | SIGMOD |
| 9 | 2,824 | Transaction Time Indexing with Version Compression | 2008 | VLDB |
| 10 | 681 | Access Methods For Multiversion Data | 1989 | SIGMOD |