Back to papers
Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates
Summary: Two algorithms enable building B+-tree-like indexes on very large tables without quiescing updates, maximizing concurrency for both unique and nonunique indexes. Restartable builds and sorts with robust long-sort/merge phases, handling concatenated keys and adapting to primary-key/secondary-index storage layouts.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 2609
- Venue
- SIGMOD
- Year
- 1992
- Pagerank
- 0.00015719411
- Overall Rank
- 875 | 93.92%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 20 of 20 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,139 |
Feeding Frenzy: Selectively Materializing Users' Event Feeds |
2010 |
SIGMOD |
0.00013725337 |
| 1,524 |
Sorting And Indexing With Partitioned B-Trees |
2003 |
CIDR |
0.00011516282 |
| 1,982 |
On-line Reorganization of Sparsely-populated B+-trees |
1996 |
SIGMOD |
9.8662834e-05 |
| 3,092 |
Asynchronous View Maintenance for VLSD Databases |
2009 |
SIGMOD |
7.5800633e-05 |
| 3,166 |
Efficient Resumption of Interrupted Warehouse Loads |
2000 |
SIGMOD |
7.4531699e-05 |
| 3,401 |
Towards Self-Tuning Data Placement in Parallel Database Systems |
2000 |
SIGMOD |
7.1400085e-05 |
| 3,428 |
Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases |
1996 |
SIGMOD |
7.1029689e-05 |
| 3,434 |
Efficient Bulk Insertion into a Distributed Ordered Table |
2008 |
SIGMOD |
7.0994919e-05 |
| 4,756 |
OODB Bulk Loading Revisited: The Partitioned-List Approach |
1995 |
VLDB |
5.9450079e-05 |
| 4,878 |
Safely and Efficiently Updating References During On-line Reorganization |
1998 |
VLDB |
5.858048e-05 |
| 5,354 |
Principles of Transaction-Based On-Line Reorganization |
1992 |
VLDB |
5.5518586e-05 |
| 6,678 |
Compensation-Based On-Line Query Processing |
1992 |
SIGMOD |
4.9657318e-05 |
| 7,200 |
Online B-Tree Merging |
2005 |
SIGMOD |
4.8030945e-05 |
| 7,524 |
On-line Reorganization in Object Databases |
2000 |
SIGMOD |
4.7180617e-05 |
| 7,743 |
Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems |
2019 |
VLDB |
4.6626575e-05 |
| 8,106 |
Resumable Online Index Rebuild in SQL Server |
2017 |
VLDB |
4.5847706e-05 |
| 9,270 |
Repeating History Beyond ARIES |
1999 |
VLDB |
4.3653385e-05 |
| 10,764 |
MD-MVCC: Multi-version Concurrency Control for Schema Changes in Azure SQL Database |
2025 |
VLDB |
4.1945683e-05 |
| 12,574 |
Transaction support for indexed summary views |
2004 |
SIGMOD |
4.1945683e-05 |
| 12,708 |
Group Updates for Relaxed Height-Balanced Trees |
1999 |
PODS |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,774 |
Query and Update Efficient B+-Tree Based Indexing of Moving Objects |
2004 |
VLDB |
0.00010604097 |
| 2,136 |
A Generic Approach to Bulk Loading Multidimensional Index Structures |
1997 |
VLDB |
9.4721139e-05 |
| 8,414 |
The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures |
2022 |
VLDB |
4.5203005e-05 |
| 1,312 |
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes |
2016 |
SIGMOD |
0.00012652548 |
| 9,421 |
Indexing Highly Dynamic Hierarchical Data |
2015 |
VLDB |
4.3441378e-05 |
| 2,363 |
Merging What’s Cracked, Cracking What’s Merged: Adaptive Indexing in Main-Memory Column-Stores |
2011 |
VLDB |
8.9580928e-05 |
| 8,767 |
Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes |
2009 |
PODS |
4.456315e-05 |
| 2,003 |
Indexing for Data Models with Constraints and Classes (Extended Abstract) |
1993 |
PODS |
9.8126082e-05 |
| 6,201 |
Concurrency Control for Adaptive Indexing |
2012 |
VLDB |
5.1600319e-05 |
| 1,524 |
Sorting And Indexing With Partitioned B-Trees |
2003 |
CIDR |
0.00011516282 |