The BT-Tree: A Branched and Temporal Access Method
Summary: BT-tree, a paginated access method for branched temporal data, enables efficient indexing of branching timelines. Implementation and experiments show storage and access efficiency with performance gains over traditional temporal indexes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Linan Jiang (Northeastern University)
- 2. Betty Salzberg (Northeastern University)
- 3. David Lomet (Microsoft)
- 4. Manuel Barrena (University of Extremadura)
BibTeX Citation
@article{jiang_vldb00,
title = {{The BT-Tree: A Branched and Temporal Access Method}},
author = {Jiang, Linan and Salzberg, Betty and Lomet, David and Barrena, Manuel},
journal = {PVLDB},
series = {{VLDB} '00},
pages = {451},
year = {2000}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,992 | OrpheusDB: Bolt-on Versioning for Relational Databases | 2017 | VLDB | 9.2366883e-05 |
| 2,280 | Decibel: The Relational Dataset Branching System | 2016 | VLDB | 8.7038926e-05 |
| 3,275 | ForkBase: An Efficient Storage Engine for Blockchain and Forkable Applications | 2018 | VLDB | 7.4691437e-05 |
| 6,681 | A Lightweight and Efficient Temporal Database Management System in TDSQL | 2019 | VLDB | 5.709926e-05 |
| 7,153 | Minuet: A Scalable Distributed Multiversion B-Tree | 2012 | VLDB | 5.5979342e-05 |
| 8,147 | DeltaNI: An Efficient Labeling Scheme for Versioned Hierarchical Data | 2013 | SIGMOD | 5.3908805e-05 |
| 9,294 | DataDiff: User-Interpretable Data Transformation Summaries for Collaborative Data Analysis | 2018 | SIGMOD | 5.1995938e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 815 | Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method | 1998 | VLDB | 0.00013689839 |
| 3,077 | The Performance Of A Multiversion Access Method | 1990 | SIGMOD | 7.6745669e-05 |
| 3,205 | Fully Persistent B+-trees | 1991 | SIGMOD | 7.5397822e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,971 | Efficient Bulk Updates on Multiversion B-trees | 2013 | VLDB |
| 2 | 9,998 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 3 | 7,325 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 4 | 2,064 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 5 | 2,310 | The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries | 2001 | VLDB |
| 6 | 6,584 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |
| 7 | 2,847 | Transaction Time Indexing with Version Compression | 2008 | VLDB |
| 8 | 687 | Access Methods For Multiversion Data | 1989 | SIGMOD |
| 9 | 3,077 | The Performance Of A Multiversion Access Method | 1990 | SIGMOD |
| 10 | 9,522 | R-Tree Based Indexing of Now-Relative Bitemporal Data | 1998 | VLDB |