The linear hash film shows the improvement over table look-up when using random keys. In real use, things are not that random so you would expect some degradation. Performance is very good early on and it is not until quite late on that clusters start to build up so that the maximum length of search increases and the average length of search as well. Even so it still only a look-up average search length of 3 after about 80% full.
