Patent ID: 7376806

Claim:
A method for managing a memory list in a data management system, comprising: allocating a plurality of spaces to a memory entry list, each space being assigned an address from a sequence of addresses beginning with a lowest address; building the entry list by writing a first entry to the space with the lowest address and only writing each subsequent new entry to a next available space with a next higher address in the sequence, the next higher address being the then current highest used address; after adding an entry to the list, setting a pointer to reference the address of the added entry; removing an interstitial entry from the list by writing the entry with the then current highest used address in the list to the address of the interstitial entry and decrementing the pointer from the then current highest used address to the next lowest address in the sequence; and removing the last entry from the list by decrementing the pointer from the then current highest used address to the next lowest address in the sequence.