Systematic Literature Review on Parallel Sorting and Searching Algorithms for Graph Analytics Problems

Main Article Content

Shajil Kumar P A
R. Srinivasa Rao Kunte
Pallavi Vaidya

Abstract

This research paper aims to systematically review the literature published recently on the topic of parallel processing algorithms for sorting and searching methods. The paper emphasizes finding the major gaps in the existing methods of using parallel sorting and searching methods for graph analytics problems and their use in scalable data science. Many peer-reviewed research papers and articles from international and national journals, conferences and other sources are searched using appropriate keywords and they are analyzed to understand the concept, current trend in the area and to find the research gaps, by employing a systematic review method of literature. The outcomes of this literature review have resulted in the need to undertake a research work on "Design and Implementation of Parallel Sorting and Searching Algorithms for Graph Analytics Problems in Scalable Data Science". Also, we have identified the required research objectives and its plan of execution for the research proposal. Systematic literature review, Topic of research proposal along with research objectives, Listing of SWOT analysis of the research agendas, Listing of ABCD analysis of the research proposal.

Article Details

How to Cite
Shajil Kumar P A, R. Srinivasa Rao Kunte, & Pallavi Vaidya. (2023). Systematic Literature Review on Parallel Sorting and Searching Algorithms for Graph Analytics Problems. Sparklinglight Transactions on Artificial Intelligence and Quantum Computing (STAIQC), 3(1), 1–15. https://doi.org/10.55011/STAIQC.2023.3101
Section
Articles