Symbolic addressing

Claim 1

A SYMBOLIC ADDRESSING SYSTEM FOR USE WITH A COMPUTER DATA STORAGE ORGANIZATION INCLUDING A MAIN MEMORY MEANS FOR STORING A PLURALITY OF DATA STRINGS WHEREIN EACH STRING IS SEPARATELY ADDRESSABLE BY THE MEMORY AND EACH STRING IS PROVIDED WITH A DISCRETE SYMBOLIC NAME SAID NAME BEING STORED WITH SAID DATA STRING IN MAIN MEMORY AT A PREDETERMINED POSITION WITH RESPECT TO THE BEGINNING ADDRESS OF SAID DATA STRING AND WHEREIN A SPECIAL ADDRESS STORAGE LOCATION IS PROVIDED IN EACH DATA STRING FOR STORING A COMPLETE MEMORY ADDRESS IN PREDETERMINED RELATIONSHIP TO SAID NAME, THE IMPROVEMENT WHICH COMPRISES A FIRST AND SECOND TABLE OF ADDRESSES, SAID FIRST TABLE COMPRISING AN AUXILIARY STORAGE MEANS THE ABSOLUTE ADDRESS TO WHICH IS DIRECTLY DERIVED FROM A CHARACTERSITIC PORTION OF THE SYMBOLIC DATA NAME, SAID TABLE CONTAINING AT LEAST ONE OF ONE MEMBER OF EACH OF A PLURALITY ADDRESS OF GROUPS OF LINKED DATA STRINGS IN THE MAIN MEMORY EACH MEMBER OF A GIVEN GROUP HAVING THE SAME CHARACTERISTIC NAME PORTIONS AS THAT UTILIZED TO DETERMINE THE ADDRESS IN THE FIRST TABLE, MEANS FOR ACCESSING SAID FIRST TABLE MEANS AT AN ADDRESS DIRECTLY RELATABLE TO A REQUESTED NAME, MEANS EXTENDING AN ADDRESS STORED IN SAID FIRST TABLE WHICH PROVIDES FOR A PROPER ENTRY POINT IN MAIN MEMORY FOR A SECOND LEVEL OF SEARCHING THROUGH A PROPER NAME GROUP, SAID SECOND TABLE MEANS COMPRISING THE COMBINATION OF SAID LINKED DATA STRINGS OF INDIVIDUAL NAME GROUPS WHICH STRINGS INCLUDE THE LINKING ADDRESSES STORED WITH EACH DATA STRING CONNECTING ALL OF THE MEMBERS OF A NAME GROUP TOGETHER MEANS FOR ENTERING A GIVEN NAME GROUP BEGINNING AT THE ADRESS OF THE DATA STRING STORED IN SAID FIRST TABLE MEANS, MEANS FOR EXTRACTING THE ADDRESS OF THE NEXT MEMBER OF SAID NAME GROUP AND, MEANS FOR CONTINUING A SEARCH OF SUCCESSIVE DATA STRINGS OF SAID NAME GROUP UNTIL A SPECIFIED NAME IS LOCATED IN ONE OF SAID DATA STRINGS.