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
- 2610
- Venue
- SIGMOD
- Year
- 1992
- Pagerank
- 0.00015708561
- Overall Rank
- 871 | 93.95%
- 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.0001371195 |
| 1,524 |
Sorting And Indexing With Partitioned B-Trees |
2003 |
CIDR |
0.00011509464 |
| 1,986 |
On-line Reorganization of Sparsely-populated B+-trees |
1996 |
SIGMOD |
9.8572036e-05 |
| 3,095 |
Asynchronous View Maintenance for VLSD Databases |
2009 |
SIGMOD |
7.5775325e-05 |
| 3,156 |
Efficient Resumption of Interrupted Warehouse Loads |
2000 |
SIGMOD |
7.4684223e-05 |
| 3,400 |
Towards Self-Tuning Data Placement in Parallel Database Systems |
2000 |
SIGMOD |
7.1346268e-05 |
| 3,433 |
Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases |
1996 |
SIGMOD |
7.0966926e-05 |
| 3,437 |
Efficient Bulk Insertion into a Distributed Ordered Table |
2008 |
SIGMOD |
7.0930413e-05 |
| 4,753 |
OODB Bulk Loading Revisited: The Partitioned-List Approach |
1995 |
VLDB |
5.9393144e-05 |
| 4,881 |
Safely and Efficiently Updating References During On-line Reorganization |
1998 |
VLDB |
5.8525783e-05 |
| 5,364 |
Principles of Transaction-Based On-Line Reorganization |
1992 |
VLDB |
5.5466304e-05 |
| 6,679 |
Compensation-Based On-Line Query Processing |
1992 |
SIGMOD |
4.9611574e-05 |
| 7,199 |
Online B-Tree Merging |
2005 |
SIGMOD |
4.7984795e-05 |
| 7,523 |
On-line Reorganization in Object Databases |
2000 |
SIGMOD |
4.7135369e-05 |
| 7,743 |
Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems |
2019 |
VLDB |
4.6581858e-05 |
| 8,111 |
Resumable Online Index Rebuild in SQL Server |
2017 |
VLDB |
4.5804259e-05 |
| 9,275 |
Repeating History Beyond ARIES |
1999 |
VLDB |
4.3613591e-05 |
| 10,770 |
MD-MVCC: Multi-version Concurrency Control for Schema Changes in Azure SQL Database |
2025 |
VLDB |
4.1905499e-05 |
| 12,583 |
Transaction support for indexed summary views |
2004 |
SIGMOD |
4.1905499e-05 |
| 12,717 |
Group Updates for Relaxed Height-Balanced Trees |
1999 |
PODS |
4.1905499e-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,766 |
Query and Update Efficient B+-Tree Based Indexing of Moving Objects |
2004 |
VLDB |
0.00010611043 |
| 2,139 |
A Generic Approach to Bulk Loading Multidimensional Index Structures |
1997 |
VLDB |
9.4618572e-05 |
| 8,408 |
The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures |
2022 |
VLDB |
4.5159669e-05 |
| 9,427 |
Indexing Highly Dynamic Hierarchical Data |
2015 |
VLDB |
4.3399748e-05 |
| 1,300 |
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes |
2016 |
SIGMOD |
0.00012711153 |
| 2,361 |
Merging What’s Cracked, Cracking What’s Merged: Adaptive Indexing in Main-Memory Column-Stores |
2011 |
VLDB |
8.9648608e-05 |
| 8,764 |
Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes |
2009 |
PODS |
4.4520434e-05 |
| 2,010 |
Indexing for Data Models with Constraints and Classes (Extended Abstract) |
1993 |
PODS |
9.8046157e-05 |
| 6,201 |
Concurrency Control for Adaptive Indexing |
2012 |
VLDB |
5.1559919e-05 |
| 1,524 |
Sorting And Indexing With Partitioned B-Trees |
2003 |
CIDR |
0.00011509464 |