Differential privacy is one of the most popular and prevalent definitions of privacy, providing a robust and mathematically rigid definition of privacy. In the last decade, adaptation of DP to graph data has received growing attention. Most efforts have been dedicated to unlabeled homogeneous graphs, while labeled graphs with an underlying semantic (e.g. RDF) have been mildly addressed. In this paper, we present a new approach based on graph projection to adapt differential privacy to RDF graphs, while reducing query sensitivity. We propose an edge-addition based graph projection method that transforms the original RDF graph into a graph with bounded typed out-degree. We demonstrate that this projection preserves neighborhood, allowing to construct a differentially private mechanism on graphs given a similar mechanism on graphs with bounded typed-out degree. Experimental and analytical evaluation through a realistic twitter use-case show that this provide up to two orders of magnitude of utility improvement.