Efficient FTL implementation with compression

1. A method for accessing a block of information stored in a solid state drive (SSD) memory, the method comprises:

obtaining, by an SSD controller, an identifier associated with the block of information;

accessing, using the identifier, a first data structure that maps identifiers to cluster maps;

wherein the first data structure comprises block sequence metadata, wherein for at least one cluster map, the block sequence metadata comprises a sequence identifier of a sequence of blocks of information that are sequentially written to the SSD memory and are stored together in a cluster of the SSD memory;

accessing a cluster map of a cluster that is associated with the sequence provide block retrieval information; and

retrieving the block of information from the SSD memory, using the block retrieval information.

2. The method according to claim 1 wherein the first data structure comprises multiple buckets, wherein the identifier is a bucket identifier that identifies a bucket out of multiple buckets.

3. The method according to claim 2 comprising accessing the bucket.

4. The method according to claim 2 wherein each bucket of the multiple buckets comprises an indication regarding a percentage of blocks of information of the bucket that are initiated in the SSD memory.

5. The method according to claim 2 wherein each bucket of the multiple buckets comprises metadata regarding one or more blocks of information, the metadata of a block of information is indicative whether the block of information is part of a sequence or not.

6. The method according to claim 2 wherein each bucket of the multiple buckets comprises metadata regarding one or more blocks of information, the metadata of a block of information that is a part of a sequence further indicates whether the block of information is a last block of information of the sequence.

7. The method according to claim 2 wherein each bucket of the multiple buckets comprises metadata regarding one or more blocks of information, the metadata of a block of information that is a part of a sequence and is a last block of information of the sequence further comprises a cluster identifier of cluster related to the sequence.

8. The method according to claim 2 wherein each bucket of the multiple buckets comprises metadata regarding one or more blocks of information, the metadata of a block of information that is a part of a sequence and is not a last block of information of the sequence further comprises an offset to a last block of information of the sequence.

9. The method according to claim 2 wherein each bucket of the multiple buckets comprises metadata regarding one or more blocks of information, the metadata of a block of information that is a part of a sequence and is not a last block of information of the sequence further comprises a pointer to an offset stored in an offset data structure, the offset is to another block of information of the sequence.

10. The method according to claim 2 wherein different sequences of a cluster are sorted according to hash values associated with the sequences, wherein the hash values are either stored in the first data structure or are calculated based on a content of the first data structure, and wherein the block retrieval information reflects the sorting of the sequences.

11. The method according to claim 2 wherein different sequences of a cluster are sorted according to times of arrival of the sequences, and wherein the block retrieval information reflects the sorting of the sequences.

12. The method according to claim 2 wherein different sequences of a cluster are sorted.

13. The method according to claim 2 wherein different sequences of a cluster are unsorted, and wherein the block retrieval information reflects the unsorting.

14. The method according to claim 2 wherein at least one first bucket is linked to a first extension bucket; and wherein the method comprises accessing the first extension bucket.