DPSA: Deterministic Parallel Search Algorithm in Large Database
Sami Qawasmeh and Arwa Zabian
DOI : 10.3844/jcssp.2017.452.459
Journal of Computer Science
Volume 13, Issue 9
The main goal of parallel processing is to reduce the complexity of finding a solution for a problem. In this study, we consider the problem of searching for multiple items at the same time in a large database. We propose a parallel search algorithm that reduces the searching time in comparison to binary search algorithm saving in that the time needed for sorting. Our algorithm works well for any data that can be represented in binary and it converts the searching of two items to search for a composed key that is the AND-combination of the two searched items. DPSA our proposed algorithm outperforms Binary search algorithm in searching for two items at the same time where the binary search will search them sequentially. The running time of our algorithm in the worst case is O(n) for searching two items in a data input of size n.
© 2017 Sami Qawasmeh and Arwa Zabian. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.