Research Article
Keyword Query Expansion Paradigm Based on Recommendation and Interpretation in Relational Databases
Algorithm 2
Translation algorithm of triples.
Input: | Output: ; | Method: | if ( is not Null) then | for to do | scan Table ; | if (matched() == TRUE) then | .add To(); | .remove(); | end if | end for | end if | if ( is not Null) then | for to do | scan Table ; | IsAN = FLASE; | foreach AN i in AN do: | if (matched() == TRUE) then | .add To(); | IsAN = TRUE; | end if | end foreach; | if (IsAN == TRUE) then | .remove(); | end if | end for | end if | if ( is not Null) then | for to do | scan Table AV; | IsAV = FLASE; | foreach AV i in AV do: | if (matched() == TRUE) then | ().add To(AVS j); | IsAN = TRUE; | end if | end foreach; | if (IsAN == TRUE) then | .remove(); | end if | end for | end if | ; | for to do | Lth = Length(); | for to | | ; | is the th | end for | end for | for to do | Lth = Length(); | for to | | ; | is the th | end for | end for | Result: ; |
|