Zero-outage database reorganization
AssigneeBMC Software, Inc.
InventorsBruce H. Mansur, Sudipta Sengupta, Gary L. Salazar
Life of this patent
Estimating the term…
Abstract
Methods and systems enable a database reorganization to occur without a database outage. In one aspect, the method includes creating a shadow copy of a database, the shadow having at least one partition associated with a plurality of first data sets and the database having at least a first partition associated with a plurality of second data sets and a second partition associated with a plurality of third data sets. The method also includes reorganizing the at least one partition of the shadow, taking the first partition offline, replacing the plurality of second data sets with the plurality of first data sets in a schema, and restarting the first partition.
Claims18
A computer-implemented method comprising:
- creating a shadow of a database, the shadow having at least one partition associated with a plurality of first data sets, the database having at least a first partition associated with a plurality of second data sets and a second partition associated with a plurality of third data sets, and the database having a schema that includes identifiers for the plurality of second data sets and identifiers for the plurality of third data sets;
- taking the first partition offline while a logical view of the first partition remains online;
- replacing the identifiers for the plurality of second data sets with identifiers for the plurality of first data sets in the schema without renaming the plurality of first data sets;
- and
- restarting the first partition.
A computer system comprising:
- at least one processor;
- a memory storing instructions executable by the at least one processor;
- a database having at least a first partition associated with a plurality of first data sets, a second partition associated with a plurality of second data sets, and a schema that includes identifiers for the plurality of first data sets and identifiers for the plurality of second data sets;
- and
- memory storing instructions executable by the at least one processor that, when executed by the at least one processor, cause the computer system to perform operations including:
- creating a shadow of the database, the shadow having at least two partitions associated with a plurality of third data sets and the database,
- pausing incoming transactions against the database,
- taking the first partition and the second partition offline while a logical view of the first partition and the second partition remains online,
- replacing the identifiers for the plurality of first data sets and the identifiers for the plurality of second data sets with identifiers for the plurality of third data sets in a schema without renaming the plurality of third data sets,
- releasing the paused transactions, and
- restarting the first partition and the second partition.
A computer system for restructuring a database comprising:
- at least one processor;
- a memory storing instructions executable by the at least one processor;
- the database having at least a first partition associated with a plurality of first data sets and a schema that includes names for plurality of first data sets;
- and
- memory storing instructions executable by the at least one processor that, when executed by the at least one processor, cause the computer system to perform operations including:
- creating a shadow of the database, the shadow being associated with a plurality of second data sets,
- taking the first partition offline while a logical view of the first partition remains online,
- quiescing the database,
- changing the names of the plurality of first data sets to names of the plurality of second data sets in the schema without renaming the plurality of second data sets,
- terminating the quiesce, and
- restarting the first partition.
Dependencies are inferred from the claim text.