Keyword Query based on Hypergraph in Relational Database

Abstract

Recently, the keyword query in relational databases has received widespread attention. The traditional methods typically traverse the entire database for the final results. With the database, structure becomes more complex and its size increases quickly; the efficiency of above methods cannot be ensured. To solve this issue, we propose a hypergraph-based keyword query method. First, the concept of hypergraph is formally defined to model the relational database. Second, the strategy of multi-granular index construction is presented to prune the irrelevant supernodes. Then, a filtering-validating query method is put forward based on the above index. Finally, experiments are taken on the dataset DBLP to verify the validity of the proposed method.