Center Node Based Data Community-Oriented Retrieval Method over Relational Database

Currently many problems about consequence discontinuities and consequence sorting dissatisfaction exist in keyword retrieval over relational database. To solve the above-mentioned problems, a data community-oriented retrieval method over relational database is proposed in this paper. Based on data graph, this method driven by center node determines a community through the combination of keyword nodes which the center node can reach. And optimal results are carried out by comparing overhead between the center nodes and each keyword node. Analyses of some experimental results show that this method not only can reduce the average delay time of retrieval effectively but also can achieve target information comprehensively, continuously and orderly.