The existing approaches of keyword search over relational databases always identify the relationships between tuples on the fly, which are rather inefficient as such relational rel...
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...