This document presents an empirical evaluation of seven RDF graph partitioning techniques: horizontal partitioning, subject-based partitioning, predicate-based partitioning, hierarchical partitioning, total communication volume minimization partitioning, recursive-bisection partitioning, and minimal edgecut partitioning. The techniques were evaluated on their partitioning time, query execution time on three systems (FedX, SemaGrow, Koral), total distinct sources selected in a distributed environment, and overall ranking. The results found that total communication volume minimization partitioning had the smallest query runtimes overall and minimized the total number of sources selected, leading to better performance.