13. The data de-duplication apparatus of claim 12 wherein the logic to traverse the nodes of the second tree to obtain the value that indicates the storage location of the matching fixed-size portions of the one of the segments of data within the dictionary comprises logic to traverse the nodes of the second tree to obtain an additional plurality of codes that correspond to another plurality of units of data.
13. The data de-duplication apparatus of claim 12 wherein the logic to traverse the nodes of the second tree to obtain the value that indicates the storage location of the matching fixed-size portions of the one of the segments of data within the dictionary comprises logic to traverse the nodes of the second tree to obtain an additional plurality of codes that correspond to another plurality of units of data. 14. The data de-duplication apparatus of claim 13 wherein the logic to traverse the nodes of the second tree to obtain the value that indicates the storage location of the matching fixed-size portions of the one of the segments of data within the dictionary further comprises logic to concatenate at least two codes of the additional plurality of codes to synthesize a second search value and logic to traverse the nodes of a third search tree to obtain the value that indicates the storage location of the matching fixed-size portion of the one of the segments of data within the dictionary.