Visual query formulation and query processing in graph database

Nowadays graphs have been using intensively in many applications because of its power to represent many natural structures encountered in real-life problems. However, most of the users of graph databases are not able to use complicated graph database query systems as, in many cases, users may have to learn new languages in order to be able to formulate graph query. Hence there is a need for a more interactive and user-friendly frameworks that allow users to easily query a graph database. PRAGUE provides an efficient framework to process graph query in graph database. The system is efficient both in terms of supporting users in formulating graph query and improving System Response Time (SRT). It proposes a new paradigm where query formulation process is interleaved with query processing process by leveraging on the latency offered by GUI. Another impressive feature of PRAGUE is that it supports both exact query and approximate query of which the latter happens most of the times in real applications. However there is still a room for improvement in PRAGUE as it may takes quite a long time for users to formulate a large query which contains several big regularly-used patterns. In this project, we examine a method to provide users with handy patterns so that they could formulate a whole pattern with just one drag-and-drop operation. Two different algorithms are proposed to process this new paradigm of graph query; they are tested with varying parameters to decide which the better one is.Bachelor of Engineerin