By Topic

Modeling a Time and Space Efficient Parallel Text Searching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Umar, I. ; Sch. of Comput. Sci., Univ. Sains Malaysia, Minden ; Abdullah, R.

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.

Published in:

Modeling & Simulation, 2008. AICMS 08. Second Asia International Conference on

Date of Conference:

13-15 May 2008