Method for storing a dataset

1. 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.

2. The computer program product of claim 1 , wherein the program instructions to store the values of each sub-dataset further comprises:

program instructions to select a next sub-dataset from the sequence of sub datasets, the next sub dataset having a respective range of values that is immediately preceding or succeeding the range of values of the sub-dataset.

3. The computer program product of claim 1 , further comprising:

program instructions to remove from the data block, data of the sub dataset that is stored on the data block.

4. The computer program product of claim 1 , wherein the dataset further comprises compressed data.

5. The computer program product of claim 1 , wherein the program instructions to randomly divide the dataset further comprises:

program instructions to use a recursive divide and conquer process.

6. 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.

7. The computer program product of claim 6 , wherein the program instructions to store the values of each sub-dataset further comprises:

program instructions to select a next sub-dataset, the next sub-dataset having a respective range of values that is immediately preceding or succeeding the range of values of the sub-dataset.

8. The computer program product of claim 6 , further comprising:

removing from the data block, data of the sub dataset that is stored on the data block.

9. The computer program product of claim 6 , wherein program instructions to randomly dividing the dataset into a sequence of multiple sub-datasets further comprises:

program instructions to use a recursive divide and conquer process; and

program instructions to control the recursive divide and conquer process to define the set of the data blocks.

10. The computer program product of claim 9 , wherein the divide and conquer process comprising Quicksort process, radix sorting process, insertion sort process or a combination thereof.