Abstract
Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size.
Highlights
A static dictionary is a subset of a finite universe with fixed set size, that is the static dictionary can be considered as collection of words with bounded size
The lexicographical search techniques are used for word look up in dictionaries, that is why the search time complexity in case of static dictionary is directly proportional to its size
In present scenario we have many approaches based on trie tree data structure and hashing techniques for word lookup in static dictionary
Summary
A static dictionary is a subset of a finite universe with fixed set size, that is the static dictionary can be considered as collection of words with bounded size. This limit that bounds the size can be huge. In present scenario we have many approaches based on trie tree data structure and hashing techniques for word lookup in static dictionary. When it comes to search a dynamic dictionary with continuously increasing size, there is not any satisfactory technique yet with promising results. The proposed technique depends on the length of the word and is independent of the size of the dictionary and best suits the needs of dynamic dictionaries
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
