[ahomescu1]

There doesn't seem to be anything dynamic about the algorithm in the article. They still need to precompute the perfect hash function(s) from the entire input data, whereas the hashing approach you linked to can handle adding data incrementally (hence the "dynamic" part).

[daveguy]

Good point. The article just does one iteration of generating the layered hash structure for lookups/reference and does not address the issue of growth of the structure. The dynamic perfect hashing technique addresses growth of the structure.