Semantic Web technologies have contributed mainly to organize the knowledge and to search about this organized knowledge. One of the most complex search is to know if two entities are related within a ontology. These are called Semantic Associations, which have been classified using ρ operators: ρ-path, ρ-join and ρ-iso. Then, a ρ-query will solve any of them. Studies about this area offer low performance execution times, but others increase the performance with pre-processing, making use of complex structures in memory. In this paper, we present semantic associations and analyze related studies. We focus on design a simplified representation of the ontology that facilitates the navigation and reduce the algorithms complexity to solve these operators, starting from the first of them: ρ-path.