• Foram Gohel

Now-a-days management of large scale RDF graph is very challenging task. It is not easy to access and manage large-scale, million-node (big) RDF graphs. A possible solution to this problem is require Map-Reduced based algorithms and techniques, in using semantic web. So RDF data management done more efficiently. From the relational database perspective, efficiency and scalability of RDF data model are derived from triplet model easily. so, in this research we describe the column oriented vertical-partitioning with triple nature of RDF. By using these different approaches we analyze that using vertical-partitioning in RDF triple nature, we can reduce storage.

RDF graphs, Map-Reduce, Semantic web, Vertical-Partitioning, COVP, etc.….

"AN EFFICIENT MANAGEMENT OF UNCERTAIN MILLIONS NODE RDF WITH MAP-REDUCE BASED ALGORITHM BY USING COLUMN ORIENTED VERTICAL-PARTITIONING TECHNIQUES IN BIG DATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.42-47, May-2019, Available :http://www.jetir.org/papers/JETIR1905L07.pdf

"AN EFFICIENT MANAGEMENT OF UNCERTAIN MILLIONS NODE RDF WITH MAP-REDUCE BASED ALGORITHM BY USING COLUMN ORIENTED VERTICAL-PARTITIONING TECHNIQUES IN BIG DATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp42-47, May-2019, Available at : http://www.jetir.org/papers/JETIR1905L07.pdf