11. The data de-duplication apparatus of claim 10 wherein the de-duplication dictionary logic adapted to traverse the nodes of the search tree comprises logic to traverse the nodes of the first search tree to obtain a plurality of codes that correspond respectively to a plurality of units of data within the fixed-size portion of the input segment.
11. The data de-duplication apparatus of claim 10 wherein the de-duplication dictionary logic adapted to traverse the nodes of the search tree comprises logic to traverse the nodes of the first search tree to obtain a plurality of codes that correspond respectively to a plurality of units of data within the fixed-size portion of the input segment. 12. The data de-duplication apparatus of claim 11 wherein the logic to traverse the nodes of the search tree further comprises logic to concatenate at least two of the codes that correspond to the plurality of units of data within the fixed-size portion of the input segment to synthesize a first search value and to traverse the nodes of the second search tree to obtain a value that indicates a storage location of the matching fixed-size portion of the one of the segments of data within the dictionary.