require the use of separate storage space to retain addresses of data blocks. In accor dance
with various exemplary implementations of the present invention, use of “searchable blocks,
as discussed herein below, obviates any need to maintain a separate storage for addresses
of data block roots. For example, searchable blocks implemented as retention roots may be
stored and referenced in accordance with a user-defined search key that need not be based …