Benchmarks
This page provides guidance figures for detection speeds, memory usage and startup times for Pattern and Trie algorithms. Pattern is more memory efficient and can be run directly from disk while Trie requires considerably more main memory but delivers millions of detections per second. For more information check out the how device detection works page.
Results stated are detections per core on a quad core i7 2.2GHz CPU.
Pattern Benchmarks
Below is a table of performance metrics relating to the Perl Pattern API. It shows the detection speed for a single request for each data set and where applicable also the mode of operation used.
Lite | Premium | Enterprise | |
---|---|---|---|
Detections Per Second | 45454 |
40000
|
47619 |
Time Per Detection (ms) |
0.022
|
0.025
|
0.021
|
Lite | Premium | Enterprise | |
---|---|---|---|
Startup Time (ms) | 416 |
1014
|
1212
|
Average Memory Usage (Mb) |
45.5
|
100.5
|
134.5
|
Hash Trie Benchmarks
Below is a table of performance metrics relating to the Perl Hash Trie API. It shows the detection speed for a single request for each data set and where applicable also the mode of operation used.
4 Threads | Lite | Enterprise |
---|---|---|
Detections Per Second | 838,138 | 862,721 |
Time Per Detection (ms) | 0.001195 | 0.001159 |
Lite | Enterprise | |
---|---|---|
Startup Time (ms) | 63 | 79 |
Average Memory Usage (Mb) | 116 | 142 |