We introduce a new data structure, the String B-tree, intended to search in unstructured data. We were focused on comparing searching in the String B-tree, with searching in Suffix Trees and String Dictionarys. More specifically we focused on efficency use of the memory hierarchies. The results shows, that the String B-tree is the fastest in searching, and has the most efficiency use of the memory hierarchies.
|