Granted Patent B2

US 9,213,731 · App. 12/779,773 · Granted Dec 15, 2015

Abstract

Claims (44)

1. A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method comprising:

accessing a block of data in a data file that is stored in a first tier of a multi-tier storage system, wherein said block of data comprises a plurality of rows and a plurality of first entries including a first entry per row, wherein each of said rows comprises a respective value for said first entry;

comparing each value of said plurality of first entries to a threshold value;

determining that said block of data is to be moved from said first tier to a second tier of said storage system if each value of said plurality of first entries is above said threshold value, wherein said second tier is different from said first tier and said first tier comprises faster performing storage than said second tier;

if said block of data is to be moved from said first tier, then relocating said block of data to said second tier, and otherwise continuing to store said block of data in said first tier; and

repeating said accessing and said determining operations at subsequent points in time to determine whether said block of data should be relocated.

2. The computer-readable storage medium of claim 1 wherein said first entry is time-based, wherein said method further comprises:

comparing said values of said first entry to a specified time value; and

selecting said first tier of said storage system for storing said block of data if any of said values is later than said specified time value and otherwise selecting said second tier of said storage system for storing said block of data, wherein said second tier is ranked lower than said first tier.

3. The computer-readable storage medium of claim 2 wherein said values of said first entry indicate times said rows were added to said block of data.

4. The computer-readable storage medium of claim 2 wherein said values of said first entry indicate times said rows were last accessed.

5. The computer-readable storage medium of claim 2 wherein said method further comprises, subsequent to storing said block of data in said second tier:

determining whether any of said rows has been modified since said storing; and

relocating said block of data to said first tier if any of said rows has been modified and otherwise maintaining said block of data in said second tier.

6. The computer-readable storage medium of claim 1 wherein said relocating comprises an operation selected from the group of: moving said block of data from said first tier to said second tier; copying said block of data to said second tier and deleting said block of data from said first tier.

7. A computer system comprising:

a processor; and

memory coupled to said processor and having stored therein instructions that, if executed by said computer system, cause said computer system to execute a method comprising:

accessing a block of data in a data file, wherein said block of data comprises a plurality of rows and a plurality of first entries including a first entry per row, wherein each of said rows comprises a respective value for said first entry;

comparing each value of said plurality of first entries to a threshold value;

determining that said block of data is to be moved if each value of said plurality of first entries is above said threshold value;

selecting a tier in a multi-tier storage system based on values of said plurality of first entries of said plurality of rows within said block of data, wherein said tier is selected based on a desired performance level, wherein higher tiers comprise faster performing storage than lower tiers; and

storing said block of data in said tier that is selected.

8. The computer system of claim 7 wherein said first entry is time-based.

9. The computer system of claim 8 wherein said method further comprises:

comparing each value for said first entry to a specified time value; and

selecting a first tier of said storage system for storing said block of data if each value for said first entry is later than said specified time value and otherwise selecting a second tier of said storage system for storing said block of data, wherein said second tier is ranked lower than said first tier.

10. The computer system of claim 9 wherein said method further comprises, subsequent to storing said block of data in said second tier:

determining whether any of said rows has been updated since said storing; and

relocating said block of data to said first tier if any of said rows has been updated and otherwise maintaining said block of data in said second tier.

11. The computer system of claim 7 wherein said storing comprises relocating said block of data from a first tier in said storage system to a second tier in said storage system, wherein said relocating comprises an operation selected from the group of: moving said block of data from said first tier to said second tier; copying said block of data to said second tier and deleting said block of data from said first tier.

12. A computer-implemented method comprising:

accessing a data file comprising a plurality of blocks of data stored in a first tier of a multi-tier storage system, each of said blocks comprising a plurality of rows and a plurality of first entries including a first entry per row, wherein each of said rows comprises a respective time based value for said first entry;

comparing each value of said plurality of first entries to a threshold value;

determining that said block of data is to be moved from said first tier to a second tier of said storage system if each value of said plurality of first entries is above said threshold value, wherein said second tier is different from said first tier and said first tier comprises faster performing storage than said second tier;

if said block of data is to be moved from said first tier, then relocating said block of data to said second tier, and otherwise continuing to store said block of data in said first tier.

13. The method of claim 12 wherein each time-based value indicates a time a corresponding row was added to said data file.

14. The method of claim 12 wherein each time-based value indicates a time a corresponding row was last accessed.

15. The method of claim 12 further comprising, subsequent to said relocating:

repeating said accessing and said determining operations at subsequent points in time to determine whether said block of data should be relocated.

16. The method of claim 15 further comprising:

relocating said block of data to a tier of said storage system that is ranked higher than said first tier.

17. The method of claim 12 wherein each row of said rows is uniquely associated with a row identifier, each row identifier comprising a first file number corresponding to said data file and a first block number corresponding to a respective block of said plurality of blocks.

18. The method of claim 17 wherein portions of said block are identified using tuples, each tuple comprising a second file number and a second block number.

Assignments (11)