Querying and retrieving data from graphs stored in distributed architecture (QRDA). (7th December 2022)

• Record Type: Journal Article
• Authors: Devi, N. Mithili; Kasireddy, Sandhya Rani
• Is Part Of: International journal of smart grid and green communications. Volume 2:Number 2(2022)
• Page Start: 139
• Page End: 149
• Publication Date: 2022-12-07
• Subjects: big graphs -- graph searching -- query graph -- query latency -- query locality -- querying -- retrieval time -- reassignment; Smart power grids -- Computer networks -- Periodicals; Smart power grids -- Periodicals; Wireless communication systems -- Security measures -- Periodicals; Wireless communication systems -- Energy consumption -- Periodicals; 333.7911028546
• Languages: English
• ISSNs: 2052-2002

Abstract

The ability to handle huge amount of data using big graphs and graph data structures plays a vital role in ever growing areas like IOT, social networking, e-commerce and bioinformatics applications. Querying graphs and extracting data in an effective manner is very crucial in big graph processing. This paper presents a framework that focuses on reassignment of vertices among partitions based on query graph so that entire query related information gets shifted to one partition to the extent possible leading to minimised query execution time. This technique first finds the partitions in which the query graph nodes are present and performs searching only in those partitions leading to minimised retrieval time. The proposed QRDA technique is compared with various state-of-art graph querying practices and the outcomes show that QRDA performance is better over other approaches.