Terracotta Discussion Forums (LEGACY READ-ONLY ARCHIVE)

I currently have a trial license for big memory go 4.1 and am interested in the improves search api (we had speed issues with the ehcache full table scan).

The results I get with bigmemory are not what I expect.
The documentation says that search should take O(log(n)) time, but it seems to be even slower than the standard cache search.

I am writing 150000 elements to a bigmemory cache and searching for some elements using criteria query and it takes around 500 ms for the search to complete the first time.

From the second time, it takes around 50ms.
Any idea why the first search query is slow?