Abstract: An improved technique is presented for organizing digitized information for storage in a relational type tree memory structure where the digitized information is broken up into blocks of a fixed byte size which are then stored throughout the memory. A header is utilized which identifies a text or image and details of how the image was digitized and compressed, to be used in reconstructing the image properly. We also utilize an index in which is the image or text identity but also in which is an index identifying the locations throughout memory at which the blocks containing the text or image information is stored. Each block has a header identifying what text or image information is stored in the block and having the address of any another block containing realsted information for the same text or image to thereby create a chaining between the blocks by which they may all be quickly located once a first block is located using the index.