Resumable Online Index Rebuild in SQL Server

  title={Resumable Online Index Rebuild in SQL Server},
  author={Panagiotis Antonopoulos and Hanuma Kodavalla and Alex Tran and Nitish Upreti and Chaitali Shah and Mirek Sztajno},
  journal={Proc. VLDB Endow.},
Azure SQL Database and the upcoming release of SQL Server enhance Online Index Rebuild to provide fault-tolerance and allow index rebuild operations to resume after a system failure or a user-initiated pause. SQL Server is the first commercial DBMS to support pause and resume functionality for index rebuilds. This is achieved by splitting the operation into incremental units of work and persisting the required state so that it can be resumed later with minimal loss of progress. At the same time… 

Figures and Tables from this paper

Intermittent Query Processing
An IQP prototype based on PostgreSQL is presented that selectively persists the state associated with query operators to allow for fast query updates while constraining resource consumption and shows that for several application scenarios IQP greatly lowers query processing latency compared to batch systems, and largely reduces memory consumption with comparable latency.
Amber: A Debuggable Dataflow System Based on the Actor Model
A system called Amber is developed that supports responsive debugging during the execution of a workflow task and is based on the actor model, a distributed computing paradigm that provides concurrent units of computation using actors.
Just-in-Time Index Compilation
This paper formalizes a composable organizational grammar, expressive enough to capture instances of not only existing index structures, but arbitrary hybrids as well, and introduces an algebra of rewrite rules for such structures.
Self-Adapting Index Compilation
This paper formalizes a composable organizational grammar, expressive enough to capture instances of not only existing index structures, but arbitrary hybrids as well, and introduces an algebra of rewrite rules for such structures, and a framework for defining and optimizing policies for just-in-time rewriting.
Fluid data structures
This paper proposes Fluid data structures, an approach to data structure design that allows limited physical changes that preserve logical equivalence, and designs a lazy-loading map that is a Fluid Cog, a lock-free data structure that incrementally organizes itself in the background by applying equivalence-preserving structural transformations.
Cloud data acquisition and processing model based on blockchain
This paper uses the Hadoop framework to implement data collection and storage of the HBase system based on big data architecture based on the existing big data storage middleware to achieve fault accountability.
Model-View-Controller based Context Visualization Method for Multimedia English Teaching System: A Case Study of Multimedia Technology Teaching
The design of this multimedia teaching system based on B/S network model and MVC design pattern for college English reading teaching has improved the students’ interest in learning English and the teaching quality has also been significantly improved.


‘Pause and resume’ functionality for index operations
  • G. Graefe, W. Guy, H. Kuno
  • Computer Science
    2011 IEEE 27th International Conference on Data Engineering Workshops
  • 2011
This paper summarizes a design for ‘pause and resume’ functionality and explores the many issues that must be addressed in order to implement such designs in a commercial system.
Online index rebuild
This method has been implemented in Sybase Adaptive Server Enterprise (ASE) Version 12.0 and provides high concurrency, does minimal amount of logging, has good performance and does not deadlock with other index operations.
Algorithms for creating indexes for very large tables without quiescing updates
Two algorithms are described for making the index-build operations restartable, without loss of all work, in case a system failure were to interrupt the completion of the creation of the index.
Enhancements to SQL server column stores
This paper gives an overview of SQL Server's column stores and batch processing, in particular the enhancements introduced in the upcoming release.
Performance of On-Line Index Construction Algorithms
There is an important trade-off between the time required to build the index and the throughput achieved by update transactions during the index construction period, and certain on-line algorithms perform very well in all but extremely resource-bound situations.
ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging
ARIES is applicable not only to database management systems but also to persistent object-oriented languages, recoverable file systems and transaction-based operating systems.
Sorting And Indexing With Partitioned B-Trees
The focus here is on re-thinking the relationship between sorting and B-trees more thoroughly, on exploiting this relationship to simplify and unify data structures and algorithms, and on gathering comprehensive lists of issues and benefits.
A critique of ANSI SQL isolation levels
It is shown that these phenomena and the ANSI SQL definitions fail to properly characterize several popular isolation levels, including the standard locking implementations of the levels covered, and new phenomena that better characterize isolation types are introduced.
The Specification Language TLA
TLA+ specifications are organized in modules that can be reused independently and are motivated by a desire for conciseness, clarity, and formality that befits a language of formal specification where executability or efficiency are not of major concern.
Implementing sorting in database systems
This survey collects many of the sorting techniques that are publicly known, but not readily available in the research literature for easy reference by students, researchers, and product developers.