An Approach to the Exact Packed String Matching Problem

Searching data is a natural behavior of humankind and is also a fundamental operation in both industrial and academic areas. There has been research into developing sophisticated methods and techniques for string searching. The common method is to make use of prefixes and suffixes to move through the text while searching a string query in a text. It suffers from high computational complexity since it has to repeatedly search each character in the string query sequentially. In this paper, we address the difficulty and propose a novel approach that enables a parallel search of the text without indexing the text or the query which is needed for sequential search. The proposed approach utilizes an XNOR operation in conjunction with the shift method to find the instance of a query. We validated it through experiments finding improvement against other methods.