Effective Searching Methodology for finding relevant Paths between nodes using Qualified Bi-Directional BFS algorithm on Graph database

With the advancement of time, technology is in its booming phase. In the present era, data whether accessed over internet or the data used by any application needs to be searched effectively and then presented to the naive i.e. end user. Searching plays a vital role in fetching the data. The search by specialization and generalization are in wide practice. The linking and associations between entities are elusive. The result of searching over the entities may engender to obtain multifarious relationships between the entities. So, it is important to make a note of all the important and meaningful relations. There arises a possibility of relationship between two entities which consist of several intermediate entities. So, to distill out the essential paths, user may specify one or more intermediate entities. Learning, optimizing and analyzing existing examples aggrandizes the research scope. Backward search, Bi-Directional search, Bi-Directional breadth first search are such existing examples where relevant path is extracted between source and destination entities. In this paper, we are proposing a qualified bi-directional BFS algorithm to discover the relevant path between the two entities which passes through the intermediate node as specified by the user. Unlike the typical searching methodologies where the all the possible paths between the two entities are discovered and then later, the paths which are relevant to user are filtered out and ranked according to user´s requirement, the qualified bi-directional BFS algorithm reduces the time in finding the resultant relevant path between the two entities as it considers only those nodes which contains user specified intermediate node. When the system will be developed and after its empirical evaluation, our proposed algorithm will ameliorate the searching and will also be time efficient.