Title: Querying and retrieving data from graphs stored in distributed architecture (QRDA)

Authors: N. Mithili Devi; Sandhya Rani Kasireddy

Addresses: Department of Computer Science, Sri Padmavathi Mahila Viswavidyalayam, Tirupathi, Andhra Pradesh, India ' IIIT-RK Valley, RGUKT-AP, Andhra Pradesh, India

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.

Keywords: big graphs; graph searching; query graph; query latency; query locality; querying; retrieval time; reassignment.

DOI: 10.1504/IJSGGC.2022.128061

International Journal of Smart Grid and Green Communications, 2022 Vol.2 No.2, pp.139 - 149

Received: 09 May 2022
Accepted: 02 Sep 2022
Published online: 04 Jan 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article