A computer-implemented method for the name-oriented accessing of files having at least zero records, any access path to files and records through an external store coupling the computer being defined by a pair of related directories. A first directory of record entries is sorted on a two-part token. The token consists of a unique sequence number assigned to the record and the sequence number of any parent record entry. Each record entry includes the token, file or record name, and external store address or pointer. A traverse through the tokens constitutes a leaf-searchable B-tree. Rapid access to target records is by way of a name- sorted, inverted directory of names and tokens as a subset and which is reconstitutable from the first directory in the event of unavailability.