Concurrent Path-Copying Update to Tree Structures
Summary: ConTree enables concurrent, order-preserving path-copying updates for general-purpose trees, beyond Contreap’s augmented BSTs. Its AERT and BeTree instantiations optimize ART and B+Tree snapshotting, delivering scalable updates and substantial speedups over serial designs. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Guanhao Hou (Chinese University of Hong Kong)
- 2. Dechuan Chen (Chinese University of Hong Kong)
- 3. Qintian Guo (Hong Kong University of Science and Technology)
- 4. Fangyuan Zhang (Chinese University of Hong Kong)
- 5. Sibo Wang (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{hou_sigmod26,
title = {{Concurrent Path-Copying Update to Tree Structures}},
author = {Hou, Guanhao and Chen, Dechuan and Guo, Qintian and Zhang, Fangyuan and Wang, Sibo},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802030},
url = {https://dl.acm.org/doi/10.1145/3802030},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,093 | AB-tree: Index for Concurrent Random Sampling and Updates | 2022 | VLDB |
| 2 | 3,057 | High-Concurrency Locking in R-Trees | 1995 | VLDB |
| 3 | 6,396 | Contention and Space Management in B-Trees | 2021 | CIDR |
| 4 | 5,530 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |
| 5 | 2,227 | Concurrency and Recovery in Generalized Search Trees | 1997 | SIGMOD |
| 6 | 464 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS |
| 7 | 13,036 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 8 | 1,663 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD |
| 9 | 4,783 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS |
| 10 | 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |