In this project it is aimed to design a graph database and queries for a social network of musicians and bands from different universities. The database is designed so that the recommendation queries run quickly and the system is not overloaded with endless node scans and cartesian products of sets for joining tables in contrast to relational databases. The properties of graph database are exploited to achieve this performance improvement.