Int J Performability Eng ›› 2018, Vol. 14 ›› Issue (4): 656-664.doi: 10.23940/ijpe.18.04.p8.656664

• Original articles • Previous Articles     Next Articles

Keyword Query based on Hypergraph in Relational Database

Yingqi Wang, Lianke Zhou, and Nianbin Wang   

  1. School of Computer Science and Technology, Harbin Engineering University, Harbin, 150001, China

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.


Submitted on December 21, 2017; Revised on January 30, 2018; Accepted on March 3, 2018
References: 20