Recursively referenced linked lists
Original Publication Date: 2005-Jan-31
Included in the Prior Art Database: 2005-Jan-31
A method is disclosed to efficiently store large amounts of data from an input stream without prior knowledge about its final size, while allowing fast access anywhere within the stored data. The storage structure is based on a particular form of linked lists, in which each link contains more than one element. Fast access of the data is achieved by storing references to each link of this list within another list, itself referenced by another, and so on until the last created list contains only one link.