US 9,852,141 B2Granted

Method for storing a dataset

AssigneeInternational Business Machines Corporation

InventorsThomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller

Life of this patent

Estimating the term…

Loading patent…

Abstract

Sorting and storing a dataset, the dataset comprising at least one attribute. The method includes defining a set of data blocks and assigning to each data block a predefined maximum number of entries or a predefined maximum amount of storage, dividing the dataset into a sequence of multiple sub-datasets each having one value or a range of values of the attribute, wherein each pair of successive sub-datasets of the sequence are non-overlapping or overlapping at their respective extremum value of the attribute, for each sub-dataset of the multiple sub-datasets: in case the sub-dataset fully or partially fits into a data block of the defined data blocks storing the sub-dataset into at least the data block, the sub-dataset that partially fits into the data block comprising a number of entries that is smaller than a predefined maximum threshold.

Claims10

Dependent claims

A computer program product for sorting and storing a dataset, the dataset comprising rows, each row comprising a value associated with an attribute, the computer program product comprising:

one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising:
program instructions to define a set of data blocks, each data block of the set of data blocks having a predefined maximum number of entries;
program instructions to define a backup data block having a backup predefined maximum number of entries which is greater than the predefined maximum number of entries;
program instructions to randomly divide the dataset into a sequence of multiple equally sized sub datasets each comprising a different range of values associated with the attribute, wherein each pair of successive sub-datasets overlap at their respective extremum value of the attribute, and wherein each of the multiple sub-datasets comprises fewer rows than each of the predefined maximum number of entries;
program instructions to store the values of each sub-dataset on a respective data block in an undefined order, wherein each value of each row is stored as a single entry on the respective data block;
program instructions to store the values of each sub-dataset on the backup data block;
program instructions to store subsequent sub-datasets on a subsequent data block, an attribute associated with each subsequent sub-dataset having a respective range of values overlapping at their respective extremum value immediately preceding or succeeding the previous range of values associated with the attribute of the sub-dataset;
and
program instructions to create for each data block an attribute value information indicating the range of values of the attribute stored on the data block for selectively processing at least part of the set of data blocks using the attribute value information.

6 more elements

A computer program product for sorting and storing a dataset, the dataset comprising rows, each row comprising a value associated with an attribute, the computer program product comprising:

one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising:
program instructions to define a set of data blocks, each data block of the set of data blocks having a predefined maximum number of entries;
program instructions to define a backup data block having a backup predefined maximum number of entries which is greater than the predefined maximum number of entries;
program instructions to randomly divide the dataset into a sequence of multiple equally sized sub datasets each comprising a different range of values associated with the attribute, wherein each pair of successive sub-datasets overlap at their respective extremum value of the attribute, and wherein each of the multiple sub-datasets comprises fewer rows than each of the predefined maximum number of entries;
program instructions to store the values of each sub-dataset on a respective data block in an undefined order, wherein each value of each row is stored as a single entry on the respective data block;
program instructions to receive a storage failure notification in response to storing one of the sub-datasets on one of the data blocks and the number of rows of the one sub dataset is greater than the number of predefined maximum number of entries;
program instructions to replace content of the one sub-dataset with a previous content of the one sub-dataset from the backup data block;
and
program instructions to create for each data block an attribute value information indicating the range of values of the attribute stored on the data block for selectively processing at least part of the set of data blocks using the attribute value information.

6 more elements

Dependencies are inferred from the claim text.

Facts

Application: 15/229,277Filed 5 Aug 2016 · continuation
Priority: 18 Nov 2015
Published: US 2017/0139943 A118 May 2017
Granted: 26 Dec 2017
Term ends: Not estimatedThe source records don’t support an estimate.

Classification17 codes

G06F 16/162
File or folder operations, e.g. details of user interfaces specifically adapted to file systems: delete operations
G06F 3/0619
Improving the reliability of storage systems: in relation to data integrity, e.g. data losses, bit errors
G06F 3/065
Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems: replication mechanisms
G06F 3/067
Adopting a particular infrastructure: distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]