QuickCN: A combined approach for efficient keyword search over databases

Abstract

Much research has been done on Keyword Search Over Relational Databases(KSORD) in recent years, and several prototypes have been developed. However, the performance of KSORD systems still is a key issue. In this paper, we propose a combined approach QuickCN for efficient KSORD. Firstly, schema graph is employed to generate Candidate Networks(CNs). Then, data graph is exploited to quickly execute CNs instead of submitting them to RDBMS. In this way, QuickCN performs more efficiently than schema-graph-based KSORD systems and consumes less memory than that by data-graph-based KSORD systems. Our experiments show that QuickCN is efficient and effective. © Springer-Verlag Berlin Heidelberg 2007.