Keyword Query Expansion Paradigm Based on Recommendation and Interpretation in Relational Databases

Algorithm 3

Query subgraph construction algorithm.

Input: Merged triples , Schema

graph

Output: Set of Query Subgraphs

Method:

   ; ;

   Let be a query subgraph;

   for to do

       Create a node for group of ;

       Let corresponds to in ;

        ;

   Insert into ;

        ;

       foreach intermediate node in do

        Create a node and insert it into ;

       foreach edge in do

        Create an edge in ;

   Add into ;

   Return ;