Exact top-k keyword search on graph databases

In this paper, by modifying an existing graph-database keyword search algorithm DPBF [1] in a straightforward strategy, we propose such an algorithm that can find exact top-k answers, with eliminating redundant answers, in an exact ranked order in <i>O</i>((2<sup><i>l</i>+1</sup><i>mk</i> + 3<sup><i>l</i></sup><i>nk</i> · log<i>k</i>)log(2<sup><i>l</i></sup… (More)