Multi-generational virtual block compaction

1. A method, comprising:

identifying a first virtual block, the first virtual block being associated with a first generation number;

determining a second virtual block as an appropriate target for live information in the first virtual block;

creating an association between the second virtual block and the first virtual block;

copying the live information from the first virtual block to the second virtual block;

updating a generation information mapping associated with the first virtual block;

associating a second generation number with the first virtual block;

receiving a read request associated with the first virtual block; and

comparing generation numbers associated with the first and second virtual blocks to determine whether live information associated with the read request is stored in the first or second virtual block.

2. The method of claim 1 , wherein the identifying the first virtual block is in response to a determination to perform a garbage collection.

3. The method of claim 1 , wherein identifying the first virtual block comprises determining that the first virtual block is sparse.

4. The method of claim 1 , wherein the updating the generation information mapping associated with the first virtual block is based on the first generation number, and the association between the second virtual block and the first virtual block.

5. The method of claim 1 , wherein determining the second virtual block as an appropriate target comprises comparing the size of available space in the second virtual block to the size of the live information of the first virtual block.

6. The method of claim 1 , further comprising:

determining that at least one of the virtual blocks is free; and

returning the free virtual block to a pool of free virtual blocks.

7. The method of claim 1 , wherein the first generation number is stored in the first virtual block.

8. The method of claim 1 , wherein updating the generation information mapping associated with the first virtual block comprises:

storing, in the generation information mapping, at least one pointer to the live information in the second virtual block and the first generation number.

9. The method of claim 1 , wherein updating the generation information mapping associated with the first virtual block comprises:

setting entries in the generation information mapping to identify storage locations in the first virtual block that no longer point to live data.

10. The method of claim 1 , further comprising:

overwriting storage for the live information in the first virtual block to at least one predetermined value that indicates that the storage no longer points to live data.

11. A system, comprising:

one or more processors; and

computer-executable program logic operating in memory, wherein the computer executable program logic enables execution across the one or more processors of:

identifying a first virtual block, the first virtual block being associated with a first generation number;

determining a second virtual block as an appropriate target for live information in the first virtual block;

creating an association between the second virtual block and the first virtual block;

copying the live information from the first virtual block to the second virtual block;

updating a generation information mapping associated with the first virtual block;

associating a second generation number with the first virtual block;

receiving a read request associated with the first virtual block; and

comparing generation numbers associated with the first and second virtual blocks to determine whether live information associated with the read request is stored in the first or second virtual block.

12. The system of claim 11 , wherein the identifying the first virtual block is in response to a determination to perform a garbage collection.

13. The system of claim 11 , wherein identifying the first virtual block comprises determining that the first virtual block is sparse.

14. The system of claim 11 , wherein the updating the generation information mapping associated with the first virtual block is based on the first generation number, and the association between the second virtual block and the first virtual block.

15. The system of claim 11 , wherein determining the second virtual block as an appropriate target comprises comparing the size of available space in the second virtual block to the size of the live information of the first virtual block.

16. The system of claim 11 , wherein the computer executable logic program enables further execution across one or more processors of:

determining that at least one of the virtual blocks is free; and

returning the free virtual block to a pool of free virtual blocks.

17. The system of claim 11 , wherein the first generation number is stored in the first virtual block.

18. The system of claim 11 , wherein the computer executable logic program enables further execution across one or more processors of:

storing, in the generation information mapping, at least one pointer to the live information in the second virtual block and the first generation number.

19. The system of claim 11 , wherein the computer executable logic program enables further execution across one or more processors of:

setting entries in the generation information mapping to identify storage locations in the first virtual block that no longer point to live data.

20. The system of claim 11 , wherein the computer executable logic program enables further execution across one or more processors of:

overwriting storage for the live information in the first virtual block to at least one predetermined value that indicates that the storage no longer points to live data.