Skip to Main Content
We proposed a parallel linear storage space with a sub linear complexity text searching algorithm by a combination of an offline and online text searching methods. We achieved this by modeling a semi-self Index which is consists of text along its index in an efficient and compact structure. This structure will only required an n storage space and also a small running time space during the search process. The proposed searching algorithm is proven to be practically efficient since it gained a near linear speedup in a parallel environment and runs in the f average of O (n/cp m log c/|Sigma|+c_time) theoretical time.