made to determine whether more input strings which are supported by the server need to have tables or table entries generated 0026 fig6 shows a chain of tables corresponding to a particular input string such as the uri 88 shown in the figure there are six segments 90 92 94 96 98 99 into which the uri 88 or portion of the uri is divided a key for each segment is calculated and designated as key 1 100 key 2 102 key 3 104 key 4 106 key 5 108 and key 6 109 a table entry location is calculated for each key based on the table base address the key and the size of the entry for segment 1 table base address 122 for table 1 110 is used and the entry location 124 for that segment is table 1 _base_address entry size key the tables 110 112 114 116 118 and 119 are linked in the order of the segments that make up the string by entering the proper base address into the next table pointer of an entry in a previous table in the final table table 5 119 in the figure the data object pointer 126 is set to point to the data object 120 corresponding to the uri and there is no entry or it is set to null for the next table pointer 128 this process is repeated for each string that the server supports the final result is a u201c tree u201d of tables with entries for each segment of each uri for example referring to fig7 which shows a chain of tables 130 132 134 136 138 140 142 corresponding to two.