A method of keyword search over relational database based on graph partition on data graph
Huiqin Xu · Journal of Jiangxi University of Science and Technology · 2013
Being different from general retrieve methods which load data graph into main memory one time,a new method of keyword search over relational database based on graph partition on data graph is proposed in the paper.A large data graph can be partitioned to a set of subgraphs which have simple connectivity and are stored in cache.Then related subgraphs are obtained through supergraph search algorithm.Only that related subgraphs are loaded into main memory and recovered to initial structure while searching for candidate results based on keywords.Then final results are obtained by ergodic subgraphs.The results conducted from the experiments show that the naive approach can address problems of processing large graph effectively when it can not be loaded into main memory one time and enable keyword search over relational database applied to large and complicate data graph without main memory constraint.