Year: 2025
Type: article
Abstract: Application of Apache's Breadth-First Search (BFS) to Big Data with order to efficiently traverse graphs with massive datasets, Spark GraphX intends to make use of Apache Spark's robust distributed processing capabilities. Focusing on scalability and speedup in processing vast graph structures, the purpose is to show that utilizing Spark GraphX for BFS is feasible and has performance advantages. By showcasing the benefits of fault tolerance and parallel processing that are intrinsic to the Spark environment, we want to provide a thorough technique for installing BFS in Spark GraphX. Applications for this method might include bioinformatics, recommendation systems, and social networks, all of which deal with large graphs. Exploring the possibility of handling complicated graph queries with substantial gains in processing speed and resource usage is possible via the integration of BFS with Spark GraphX. This advances the capabilities of big data analytics in graph processing. In one example of Node Distance from Source, the numbers vary from 32 to 93 kilometers, while in another case with 5 nodes linked, the results range from 14 to 78 kilometers. When comparing the two sets of data, the values are 23 to 98 kilometers. These ranges are all derived from the Sample Graph Data.
Authors: Palaniraj Rajidurai Parvathy, J Lenin, Suman Mishra
Institution: Alliance University
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4413956806