The amount of String data around the world is constantly growing. As more of it accumulates, methods to search through it, and at higher capacities needs to be continually improved. This thesis analyzes string searching solutions that: support dynamic updates, support prefix searching, and can perform well using external memory. These solutions are compared against each other using different types of string data while performing various operations. The strengths and weaknesses of each solution is then identified and discussed.