Open oliver-krebs opened 6 years ago
Okay, thank you. How can we implement it then? – Does that mean we have to restructure our database?
Currently the database for the symbols is handled with a List. The searching by going through all elements of the list is very expensive (time). Something like a SuffixTrie would make it much faster. Maybe we can use an implementation like this one: https://github.com/gmamaladze/trienet
The searching for symbols can be improved (faster) with a trie, e.g. from Trienet