An Efficient and Scalable Cloud Approach for Managing the Data in the Cloud

Kancherla Rajasree, Yarlagadda Siva Koteswara Rao

Abstract


In spite of late advances in dispersed Resource Description Frame work (RDF) information administration, preparing a lot of RDF information in the cloud is still extremely difficult. Disregarding its apparently straightforward information display, RDF really encodes rich and complex charts blending both case and construction level information. Sharding such information utilizing established systems or dividing the diagram utilizing conventional min-slice calculations prompts extremely wasteful dispersed operations and to a high number of joins. In this paper, we depict DiploCloud, a productive and adaptable conveyed RDF information administration framework for the cloud. In opposition to past methodologies, DiploCloud runs a physiological investigation of both occurrence and blueprint data preceding apportioning the information. In this paper, we depict the design of DiploCloud, its principle information structures, and additionally the new calculations we use to segment and disseminate information. We likewise exhibit a broad assessment of DiploCloud demonstrating that our framework is frequently two requests of greatness speedier than cutting edge frameworks on standard workloads.


References


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. Cudre-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. Cudre-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: http://dl.acm.org/citation.cfm? 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. Cudre-Mauroux, and P. Groth, “Executing provenance- enabled queries over web data,” in Proc. 24th Int. Conf.World Wide Web, 2015, pp. 1275–1285.

B. Haslhofer, E. M. Roochi, B. Schandl, and S. Zander. (2011). Europeana RDF store report. Univ. Vienna, Wien, Austria, Tech.Rep. [Online]. Available: http://eprints.cs.univie.ac.at/2833/1/europeana_ts_report.pdf

Y. Guo, Z. Pan, and J. Heflin, “An evaluation of knowledge base systems for large OWL datasets,” in Proc. Int. Semantic Web Conf.,2004, pp. 274–288.

Faye, O. Cure, and Blin, “A survey of RDF storage approaches,”ARIMA J., vol. 15, pp. 11–35, 2012.

B. Liu and B. Hu, “An Evaluation of RDF Storage Systems for Large Data Applications,” in Proc. 1st Int. Conf. Semantics, Knowl.Grid, Nov. 2005, p. 59.

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.

T. Neumann and G. Weikum, “RDF-3X: A RISC-style engine for RDF,” Proc. VLDB Endowment, vol. 1, no. 1, pp. 647–659, 2008.

A. Harth and S. Decker, “Optimized index structures for querying RDF from the web,” in Proc. IEEE 3rd Latin Am. Web Congr., 2005, pp. 71–80.

M. Atre and J. A. Hendler, “BitMat: A main memory bit-matrix of RDF triples,” in Proc. 5th Int. Workshop Scalable Semantic Web Knowl. Base Syst., 2009, p. 33.

K. Wilkinson, C. Sayers, H. A. Kuno, and D. Reynolds, “Efficient RDF Storage and Retrieval in Jena2,” in Proc. 1st Int. Workshop Semantic Web Databases, 2003, pp. 131–150.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.