Sorting a User Identification Table
Original Publication Date: 1985-Jun-01
Included in the Prior Art Database: 2005-Feb-18
A method for quickly searching a data base, e.g., a user identification number table, is described. Certain types of data, referred to and searched periodically, are most quickly accessed if kept sorted as new entries are added and old entries are removed. In small systems with limited storage space, the movement of entries associated with changing the data base may not be possible in terms of either time or space. The number of entries may also be too large to search in an allotted period of time. The general idea is to sort the data into groups, called piles, according to the first digit of the criteria. Each pile is separated from the other pile by as much space as possible, depending on the amount of memory available. Each pile is then sorted when there is available time on the processor.