The authors exploit the concepts of Petri nets for the modeling of databases through a meaningful interpretation of various database structures. This has been achieved using, specifically, the reachability and conflict concepts of Petri nets. The concept of conflict has been given a mathematical interpretation to suit its applications to database structures. Starting with a network structure, a new class of application for the reachability equation has been proposed. Based upon this, an algorithm has been postulated to access the data paths between any two specified nodes in the database model. The goal is to provide useful data for the design of databases.