DBScholar

Back to papers

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)

Paper ID
h9bc7191ed3eb232f
Venue
SIGMOD
Year
2026
Pagerank
4.9605343e-05
Overall Rank
10,506 | 29.58%
DOI
10.1145/3802030
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Rank Cited Paper Year Venue Pagerank
68 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00037861537
209 Cache Conscious Indexing for Decision-Support in Main Memory 1999 VLDB 0.00024915373
504 FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory 2016 SIGMOD 0.00017195543
692 On An Algebra For Historical Relational Databases. Two Views 1985 SIGMOD 0.00014701559
892 SuRF: Practical Range Query Filtering with Fast Succinct Tries 2018 SIGMOD 0.00013207671
906 HOT: A Height Optimized Trie Index for Main-Memory Database Systems 2018 SIGMOD 0.00013129817
1,210 Immortal DB: Transaction Time Support for SQL Server 2005 SIGMOD 0.00011495323
1,328 Building a Bw-Tree Takes More Than Just Buzz Words 2018 SIGMOD 0.00011013165
2,303 In-Memory Performance for Big Data 2015 VLDB 8.6602545e-05
2,489 Timeline Index: A Unified Data Structure for Processing Queries on Temporal Data in SAP HANA 2013 SIGMOD 8.379041e-05
2,881 Exploiting Directly-Attached NVMe Arrays in DBMS 2020 CIDR 7.8945474e-05
3,090 Persistent Data Sketching 2015 SIGMOD 7.6420011e-05
3,108 Skippy: a New Snapshot Indexing Method for Time Travel in the Storage Manager 2008 SIGMOD 7.6237576e-05
3,763 Searching in Time 2006 SIGMOD 7.0180801e-05
3,802 B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives 2012 VLDB 6.9914085e-05
5,399 At-the-time and Back-in-time Persistent Sketches 2021 SIGMOD 6.1336701e-05
7,049 BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees 2023 VLDB 5.5967284e-05
7,391 HINT: A Hierarchical Index for Intervals in Main Memory 2022 SIGMOD 5.5208477e-05
9,585 B-Trees Are Back: Engineering Fast and Pageable Node Layouts 2025 SIGMOD 5.1406489e-05
11,296 Efficient Concurrent Updates to Persistent Randomized Binary Search Trees 2025 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Semantically Similar Papers