Programa de Ingeniería de Sistemas
Nowadays, graph-based models are found in different domains where both concepts and relationships contain rich and diverse information expressed by types and attributes. In some applications, graphs contain millions of concepts and it is required to support queries efficiently. However, the growing size of graph databases and the richness and the variety of their data have made it difficult to resolve this problem in reasonable time. Given that existing solutions are not able to deal with the current demands, it is quite pertinent to keep exploring new solutions from different approaches in order to efficiently query large graphs. In this thesis, we apply a string matching technique called parameterized matching to evaluate the isomorphism and containment relations between graphs with or without attributes.