With the hash table, the random access is only 2.18 times slower than the random access in the array. Indeed, two random accesses are required: one for the rst element of the key bucket to do the search, and one for the value of the integral. e remaining time corresponds to the binary search. e results show that data locality is exploited: when the access is done with a regular access pa ern, the data is fetched roughly 3 times faster than using a random access, giving a latency below the latency of a random access in the array.