Paper Info
Title
Modeling a Time and Space Efficient Parallel Text Searching
Abstract
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.
Year
DOI
Venue
2008
10.1109/AMS.2008.84
Asia International Conference on Modelling and Simulation
Keywords
Field
DocType
compact structure,near linear speedup,space efficient,parallel environment,parallel text searching,parallel linear storage space,semi-self index,online text,n storage space,theoretical time,time space,sub linear complexity text,sorting,text analysis,indexation,parallel algorithms,search algorithm,parallel algorithm,burrows wheeler transform,computational complexity,computer simulation,computational modeling,data structures,concurrent computing
Data structure,Search algorithm,Burrows–Wheeler transform,Parallel algorithm,Computer science,Spacetime,Algorithm,Suffix array,Computational complexity theory,Speedup
Conference
ISBN
Citations 
PageRank 
978-0-7695-3136-6
0
0.34
References 
Authors
11
2
Name
Order
Citations
PageRank
Ibrahim Umar1103.92
Rosni Abdullah215624.82