GPU based Suffix Array Pattern Matching Approach for Big Data | Zendy

Vinay Katoch | Zendy; Sanjay Silakari | Zendy; Uday Chourasia | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

GPU based Suffix Array Pattern Matching Approach for Big Data

Author(s) -

Vinay Katoch,

Sanjay Silakari,

Uday Chourasia

Publication year - 2017

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2017914668

Subject(s) - computer science , suffix , matching (statistics) , big data , suffix array , string searching algorithm , pattern matching , artificial intelligence , pattern recognition (psychology) , data mining , data structure , programming language , philosophy , linguistics , statistics , mathematics

Big data has been an emerging problem these days. To solve this problem Hadoop has evolved as a most widely used tool and adopted by various popular MNCs like Facebook and Yahoo. To search large number of pattern in big data is a challenging task. Map/Reduce is used to write codes to perform pattern matching on big data. In this work OpenCL is combined with Apache Hadoop to write fast Map/Reduce for pattern matching in data using suffix arrays.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research