Title: A Hashing-Based Parallel Algorithm for Multiple Object String Matching on the Cluster Computing Systems
Abstract:Based on the Chinese Remainder Theorem, a perfect Hash function for processing string is constructed, and a parallel algorithm for multiple object string matching on the cluster computing systems is p...Based on the Chinese Remainder Theorem, a perfect Hash function for processing string is constructed, and a parallel algorithm for multiple object string matching on the cluster computing systems is presented by applying the Karp-Rabin pattern matching approach and the filter technique. In this algorithm, a given string is uniquely mapped to a pair of integer values, the pair of integer values is compared to implement the string matching procedure. The comparison and filter techniques can speed up the matching process and obtain the determinate match results. The algorithm analysis and experimental results show that the parallel algorithm is concise, efficient and scalable.Read More
Publication Year: 2007
Publication Date: 2007-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot