DBScholar

Back to papers

Concurrency and Recovery in Generalized Search Trees

Summary: Generalized concurrency control and recovery algorithms for GiST, applicable to diverse tree indexes. Link-based protocol avoids node locks during I/Os; repeatable read via predicate locks and 2PL; shows why B-tree techniques fail for general trees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hd264a56cdcdf0069
Venue
SIGMOD
Year
1997
Pagerank
8.7304715e-05
Overall Rank
2,263 | 84.79%
DOI
10.1145/253260.253272

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kornacker_sigmod97,
        title = {{Concurrency and Recovery in Generalized Search Trees}},
        author = {Kornacker, Marcel and Mohan, C. and Hellerstein, Joseph M.},
        series = {{SIGMOD} '97},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/253260.253272},
        url = {https://dl.acm.org/doi/10.1145/253260.253272},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Rank Citing Paper Year Venue Pagerank
815 Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method 1998 VLDB 0.00013689839
1,605 The Data Calculator*: Data Structure Design and Cost Synthesis from First Principles and Learned Cost Models 2018 SIGMOD 0.00010093796
1,875 Storage Management in AsterixDB 2014 VLDB 9.4576907e-05
1,889 Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn 2019 CIDR 9.4273689e-05
2,911 Indexing Large Trajectory Data Sets With SETI* 2003 CIDR 7.8720638e-05
3,034 A Revised R*-tree in Comparison with Related Index Structures 2009 SIGMOD 7.7330662e-05
5,282 High-Performance Extensible Indexing 1999 VLDB 6.1988765e-05
6,080 From Auto-tuning One Size Fits All to Self-designed and Learned Data-intensive Systems 2019 SIGMOD 5.8924903e-05
6,174 Helios: Hyperscale Indexing for the Cloud & Edge 2020 VLDB 5.8612829e-05
6,614 Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads 2012 SIGMOD 5.7336267e-05
7,584 Effectively Indexing Uncertain Moving Objects for Predictive Queries 2009 VLDB 5.4903974e-05
7,710 The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures 2022 VLDB 5.4713723e-05
7,837 Efficient Concurrency Control in Multidimensional Access Methods 1999 SIGMOD 5.4434696e-05
8,134 Locking Protocols for Materialized Aggregate Join Views 2003 VLDB 5.3930626e-05
9,149 Towards Systematic Index Dynamization 2024 VLDB 5.2186338e-05
9,532 Repeating History Beyond ARIES 1999 VLDB 5.1644268e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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.001992968
90 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00034860244
206 Generalized Search Trees for Database Systems (Extended Abstract) 1995 VLDB 0.00024986675
221 ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes 1990 VLDB 0.00024274803
471 Concurrent Operations on B-Trees with Overtaking 1985 PODS 0.0001769727
983 ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging 1992 SIGMOD 0.00012706526
1,526 Key Range Locking Strategies for Improved Concurrency 1993 VLDB 0.0001035143
1,692 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 9.8570044e-05
3,111 High-Concurrency Locking in R-Trees 1995 VLDB 7.6374094e-05
3,170 Access Method Concurrency with Recovery 1992 SIGMOD 7.5691807e-05
5,237 Commit LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems 1990 VLDB 6.2170143e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 1,316 Concurrency Control In A Dynamic Search Structure 1982 PODS
2 3,111 High-Concurrency Locking in R-Trees 1995 VLDB
3 5,661 A Framework for the Performance Analysis of Concurrent B-tree Algorithms 1990 PODS
4 7,164 Operation Specific Locking In B-Trees 1987 PODS
5 4,904 Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms 1984 PODS
6 1,692 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD
7 13,326 New Concurrency Control Algorithms for Accessing and Compacting B-Trees 1994 VLDB
8 3,170 Access Method Concurrency with Recovery 1992 SIGMOD
9 206 Generalized Search Trees for Database Systems (Extended Abstract) 1995 VLDB
10 7,837 Efficient Concurrency Control in Multidimensional Access Methods 1999 SIGMOD