Key addressing of random access memories by radix transformation

The addressing procedure for nonsequentially stored data in large capacity random access memories is the automatic allocation of storage position to each member of a data set. Each member, termed here as a record, is identified by a unique description or key which is part of the record. Key addressing then is the execution of a mapping function which mathematically relates the key of a record to its location in storage. To store or to retrieve a record, its key is presented to the addressing facility which then generates an address to which the memory will then access.