Open Access Open Access  Restricted Access Subscription or Fee Access

An Approach for Managing Data in Cloud Using Resource Description Framework (RDF)

M.Sowjanya Reddy


Despite of late advances in appropriated Resource Description Framework information administration, handling a lot of RDF information in the cloud is still exceptionally difficult. Many of the original semi-structured data promises, such as flexible structure, optional schema, and rich, adaptable URIs as a basis for information sharing, are poised to be fulfilled by the W3C's Resource Description Framework (or RDF, for short). Furthermore, RDF is in a unique position to benefit from the research activities of scientific communities interested in databases, knowledge representation, and Web technologies. As a result, a plethora of RDF data collections have been published, ranging from scientific data to general-purpose ontologies to accessible government data, all as part of the Linked Data movement. Despite its seemingly simple information display, RDF really includes rich and complicated graphs that combine information from both the event and composition levels. Shading such data with traditional methods or parceling the diagram with traditional min-slice computations results in a lot of wasted dispersed operations and a lot of joins. DiploCloud is a capable and adaptive distributed Resource description framework information administration framework for the cloud, which we present here. In contrast to previous methods, DiploCloud does a physiological analysis of both event and composition data before dividing it. The engineering of DiploCloud, core information structures, and innovative calculations used to partition and spread information are depicted in the report below. Show a comprehensive evaluation of DiploCloud, revealing that our framework is frequently two requests of magnitude faster than best in class frameworks on routine jobs.


DiploCloud, RDF, Cloud, Sharing Data, framework

Full Text:



L. Ding, Y. Peng, P. P. da Silva, and D. L. McGuinness, “TrackingRDF graph provenance using RDF molecules,” in Proc. Int. Semantic Web Conf., 2005.

M. Brocheler, A. Pugliese, and V. Subrahmanian, “Dogma: A disk- € oriented graph matching algorithm for RDF databases,” in Proc. 8th Int. Semantic Web Conf., 2009, pp. 97–113

S. Harris, N. Lamb, and N. Shadbolt, “4store: The design and implementation of a clustered RDF store,” in Proc. 5th Int. Workshop Scalable Semantic Web Knowl. Base Syst., 2009, pp. 94–109.

S. Das, D. Agrawal, and A. El Abbadi, “G-store: A scalable data store for transactional multi key access in the cloud,” pp. 163–174 2010.

Z. Kaoudi and I. Manolescu, “RDF in the clouds: A survey,” VLDB J. Int. J. Very Large Data Bases, vol. 24, no. 1, pp. 67–91, 2015.

C. Weiss, P. Karras, and A. Bernstein, “Hexastore: sextuple indexing for semantic web data management,” Proc. VLDB Endowment, vol.1, no.1, pp.1008–1019,2008.

K. Aberer, P. Cudre-Mauroux, M. Hauswirth, and T. van Pelt, “GridVine: Building Internet-scale semantic overlay networks,” in Proc. Int. Semantic Web Conf., 2004, pp. 107–121.

P. Cudr e-Mauroux, S. Agarwal, and K. Aberer, “GridVine: An infrastructure for peer information management,” IEEE Internet Comput., vol. 11, no. 5, pp. 36–44, Sep./Oct. 2007.

M. Wylot, J. Pont, M. Wisniewski, and P. Cudr e-Mauroux. (2011). dipLODocus[RDF]: Short and long-tail RDF analytics for massive webs of data. Proc. 10th Int. Conf. Semantic Web - Vol. Part I, pp. 778–793 [Online]. Available: id=2063016.2063066.

M. Wylot, P. Cudre-Mauroux, and P. Groth, “TripleProv: Efficient processing of lineage queries in a native RDF store,” in Proc. 23rd Int. Conf. World Wide Web, 2014, pp. 455–466.

M. Wylot, P. Cudr e-Mauroux, and P. Groth, “Executing provenance-enabled queries over web data,” in Proc. 24th Int. Conf. World Wide Web, 2015, pp. 1275–1285.


  • There are currently no refbacks.

Copyright (c) 2022 Journal of Telecommunication, Switching Systems and Networks