Results for Exercise Sheet 5 (Error Tolerant Prefix Search)
Please read the instructions below, before adding something to the table!
Add your row to the table below, following the examples already there.
- #elem in union: The number of elements in the vector returned by the union method.
- #candidates: The number of elements whose count exceeded the threshold and hence have to be checked by checkPrefixEditDistance
- #matches: The number of matches, i.e. elements that passed checkPrefixEditDistance
Name |
perf |
uniwersity |
Processor / RAM |
Language |
|||||||
#elem in union |
#candidates |
#matches |
time for findMatches() |
#elem in union |
#candidates |
#matches |
time for findMatches() |
||||
Björn |
530406 |
530406 |
14068 |
330ms |
650616 |
26425 |
4221 |
107ms |
Intel X5560 @ 2.8GHz / 36GB |
C++ |
|