Querying and retrieving data from graphs stored in distributed architecture (QRDA)
by N. Mithili Devi; Sandhya Rani Kasireddy
International Journal of Smart Grid and Green Communications (IJSGGC), Vol. 2, No. 2, 2022

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.

Online publication date: Wed, 04-Jan-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Smart Grid and Green Communications (IJSGGC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com