• Urvashi Kathiriya
• Tadhani Jaydeep

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 competency. From the relational database appearance, competency and scalability of RDF data model are derived from triplet model easily. so, in this survey we describe the different types of approaches by using 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 time as well as storage also.

RDF graphs, Map-Reduce, Semantic web, Vertical-Partitioning, Hexastore

"A SURVEY ON MANAGING BIG RDF GRAPH BY USING MULTIPLE INDEXING APPROACHES AND MAP-REDUCE BASED ALGORITHM IN BIG DATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.388-392, April-2019, Available :http://www.jetir.org/papers/JETIR1904P62.pdf

"A SURVEY ON MANAGING BIG RDF GRAPH BY USING MULTIPLE INDEXING APPROACHES AND MAP-REDUCE BASED ALGORITHM IN BIG DATA", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp388-392, April-2019, Available at : http://www.jetir.org/papers/JETIR1904P62.pdf