Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM63181
Volume:
10 |
5 |
May 2026
Pages:
1-5
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Department of Master of Computer Applications
Bapuji Institute of Engineering and Technology, Davanagere
Department of Master of Computer Applications
Bapuji Institute of Engineering and Technology, Davanagere
The recent rise of big graphs with a large number of interconnected data including those found in social networking and supply chain networks has emphasized the need for efficient graph analytics. However processing and analyzing big graphs including those that contain millions of nodes and trillions of edges is a challenging task and the current graph processing systems are inefficient in dealing with such data and have resulted in a bottleneck effect. In this report a detailed graph analytics is presented. In proposing their system the authors benefit from using a distributed computing model allowing them to efficiently divide and process large- scale graphs among multiple machines in order to take advantage of parallelism in complex graph computation. Some of the key attributes associated with their system are its robust programming model ranging from basic graph analysis techniques like those in fundamental traversal and centrality computation to more sophisticated techniques in community detection and link prediction. With the integration of algorithms for graph analysis this project aspires to extract rich information in regard to social networking and supply chain dynamics. Regarding social graph analysis this tool is capable of analyzing influential people in social networking platforms social group identification as well as social connections in the coming future. Regarding supply chain analysis this tool is capable of optimizing logistics critical dependency identification as well as analysis through graph representation of material as well as information flow.
KEYWORDS
"Scalable Graph Analytics on Big Graphs" is a considerable advancement in the state of the art and science of large-scale data processing and graph analytics By addressing and overcoming the two most important challenges of scalability performance and ease of use and consequently improving the ability of graph processing systems this effort will provide a practical and efficient platform with the potential of finding out a wealth of insights from the interconnected data of social networks and supply chains The novel hybrid compute model along with intelligent graph partitioning is expected to deliver a dramatic speedup over the classical synchronous models for analyzing large graphs The native support for dynamic graphs is an integral part of the distinguishing feature set that enables applications from fraud detection to dynamic logistics optimization The availability of both high-level query language and programmatic APIs is expected to make the system accessible for from data analysts to data scientists democratizing the graph analytics capability The integrated visualization and exploration capabilities will greatly impact how users will be exposed to graph data from a static report to an interactive process of discovery and knowledge building and by seamlessly integrating with the bigger data ecosystem this proposed system will make it easy for organizations to create complex analytical processes
1. G Malewicz et al “Pregel: A System for Large-Scale Graph Processing” Proc ACM SIGMOD Int Conf Management of Data 2010 2. J E Gonzalez et al “Power Graph: Distributed Graph-Parallel Computation on Natural Graphs” Proc USENIX OSDI 2012 3. R S Xin et al “Graph X: A Resilient Distributed Graph System on Spark” Proc GRADES Workshop 2013 4. B Perozzi et al “Deep Walk: Online Learning of Social Representations” Proc ACM SIGKDD 2014 5. W Hamilton Z Ying and J Leskovec “Inductive Representation Learning on Large Graphs” Neur IPS 2017 6. T N Kipf and M Welling “Semi- Supervised Classification with Graph Convolutional Networks” ICLR 2017 7. J Devlin et al “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding” NAACL- HLT 2019 8. J Chen J Zhu and L Song “Stochastic Training of Graph Convolutional Networks with Variance Reduction” ICML 2018 9. Neo4j Inc Neo4j Graph Database Documentation 2024 [Online] Available: https://neo4jcom/docs/
Publication Date
5/14/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
2
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...