On one method for organizing data arrays in a direct access memory

A method is proposed for organizing data arrays in a direct access memory which satisfies the requirement that memory is used economically and the search is operative. The associative information is represented as a sequential graph on the set of whose paths functions of numeration and listing are constructed.