QuickCN: a combined approach for efficient keyword search over databases

Authors:
Jun Zhang;Zhaohui Peng;Shan Wang
Affiliations:
School of Inf., Renmin Univ. of China, Beijing, P.R. China and Key Lab. of Data Eng. and Knowledge Eng. (Renmin Univ. of China), MOE, Beijing, P.R. China and Computer Science and Techn. College, D ...;School of Information, Renmin University of China, Beijing, P.R. China and Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China), MOE, Beijing, P.R. China;School of Information, Renmin University of China, Beijing, P.R. China and Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China), MOE, Beijing, P.R. China
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 3
Cited 1

DBXplorer: A System for Keyword-Based Search over Relational Databases

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Keyword Searching and Browsing in Databases using BANKS

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient IR-style keyword search over relational databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Study on efficiency and effectiveness of KSORD

APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management

Quantified Score

Hi-index	0.00

Visualization

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.