Database Paper Browser

Back to papers

Automatic Workload Driven Index Defragmentation

Summary: Introduces workload-driven, online range-based defragmentation of B-Tree indexes, avoiding whole-tree rewrites. Demonstrates low-overhead benefit tracking and policy-driven automatic defragmentation in SQL Server, enabling targeted I/O improvement with minimal DBA effort. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10213
Venue
VLDB
Year
2011
Pagerank
4.4743572e-05
Overall Rank
8,640 | 39.96%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
2,050 Automatically Indexing Millions of Databases in Microsoft Azure SQL Database 2019 SIGMOD 9.6883066e-05
8,653 Adaptive Hybrid Indexes 2022 SIGMOD 4.4696663e-05
8,764 Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes 2009 PODS 4.4520434e-05
1,485 On the Analysis of Indexing Schemes 1997 PODS 0.00011698762
1,524 Sorting And Indexing With Partitioned B-Trees 2003 CIDR 0.00011509464
4,363 Indexing on Modern Hardware: Hekaton and Beyond 2014 SIGMOD 6.2476591e-05
4,107 Cracking the Database Store 2005 CIDR 6.4384924e-05
237 An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server 1997 VLDB 0.00031727601
407 Database Cracking 2007 CIDR 0.00023941779
517 AutoAdmin "What-if" Index Analysis Utility 1998 SIGMOD 0.00021193179