Size: 1377
Comment:
|
Size: 1291
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 7: | Line 7: |
TODO: this is the wrong table | * #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 |
Line 9: | Line 11: |
||<style="text-align:center" |3>'''Name''' ||||||||||||<style="text-align:center">''american (165318 elements)'' ||||||||||||<style="text-align:center">''freiburg (310 elements)'' ||<style="text-align:center" |3>'''Processor / RAM''' ||||<style="text-align:center" |3>'''Language''' || ||||||<style="text-align:center">''vbyte'' ||||||<style="text-align:center">''golomb'' ||||||<style="text-align:center">''vbyte'' ||||||<style="text-align:center">''golomb'' || ||<style="text-align:center">'''ratio''' ||<style="text-align:center">'''comp''' ||<style="text-align:center">'''deco''' ||<style="text-align:center">'''ratio''' ||<style="text-align:center">'''comp''' ||<style="text-align:center">'''deco''' ||<style="text-align:center">'''ratio''' ||<style="text-align:center">'''comp''' ||<style="text-align:center">'''deco''' ||<style="text-align:center">'''ratio''' ||<style="text-align:center">'''comp''' ||<style="text-align:center">'''deco''' || ||Björn ||4.00 ||1232µs ||1843µs ||7.86 ||10292µs ||5871µs ||2.04 ||6µs ||8µs ||2.28 ||62µs ||23µs ||Intel X5560 @ 2.8GHz / 36GB ||C++ || |
||<style="text-align:center" |2>'''Name''' ||||||||<style="text-align:center">'''perf''' ||||||||<style="text-align:center">'''uniwersity''' ||<style="text-align:center" |2>'''Processor / RAM''' ||||<style="text-align:center" |2>'''Language''' || ||<style="text-align:center">''#elem in union'' ||<style="text-align:center">''#candidates'' ||<style="text-align:center">''#matches'' ||<style="text-align:center">''time for findMatches()'' ||<style="text-align:center">''#elem in union'' ||<style="text-align:center">''#candidates'' ||<style="text-align:center">''#matches'' ||<style="text-align:center">''time for findMatches()'' || ||Björn ||530406||530406||14068||330ms||650616||26425||4221||107ms||Intel X5560 @ 2.8GHz / 36GB ||C++ || |
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++ |