Current addressing system

Claim 1

IN A COMPUTER DATA STORAGE SYSTEM INCLUDING A HIGH SPEED RANDOMLY ADDRESSABLE WORD ORGANIZED MEMORY WHEREIN A GIVEN DATA STRING COMPRISING A PLURALITY OF VARIABLE FIELD LENGTH MACHINE WORDS ORGANIZED INTO A PLURALITY OF HIERARCHICAL LEVEL MAY BE ADDRESSED AT ITS BEGINNING POINT BY PROVIDING THE MEMORY ORGANIZATION WITH A BEGINNING ADDRESS, SAID BEGINNING ADDRESS FURTHER GIVING ACCESS TO A SPECIAL MEMORY STORAGE LOCATION HAVING SUFFICIENT STORAGE SPACE FOR STORING AT LEAST ONE COMPLETE X-Y MEMORY ADDRESS WHICH CONSTITUTES A CURRENT ADDRESS, THE IMPORVEMENT WHICH COMPRISES A SEARCH INSTRUCTION INTERPRETATION SYSTEM INCLUDING: MEANS FOR SELECTIVELY ACCESSING THIS SPECIAL STORAGE LOCATION UPON COMMAND; MEANS FOR AUTOMATICALLY READING OUT SAID "CURRENT" ADDRESS STORED THEREIN SAID CURRENT ADDRESS COMPRISING THE ADDRESS OF THE LAST PORTION OF DATA IN SAID DATA STRING ACCESSED; MEANS FOR AUTOMATICALLY USING THIS ADDRESS AS THE STARTING POINT FOR A NEW SEARCH IN SAID DATA STRING, AND MEANS FOR AUTOMATICALLY STORING THE ADDRESS OF A NEW PORTION OF DATA ACCESSED IN THE DATA STRING IN SAID SPACED STORAGE LOCATION.