The thesis investigates the problem of finding sound and complete typing algorithms for regular path queries for graph databases where the schemas are specified using constructs from description logics.