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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, S., Zhang, K.: Searching Databases with Keywords. Journal of Computer Science and Technology 20(1), 55–62 (2005)
Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-Style Keyword Search over Relational Databases. In: VLDB, pp. 850–861 (2003)
Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer:A System for keyword Search over Relational Databases. In: ICDE, pp. 5–16 (2002)
Bhalotia, G., Hulgeri, A., Nakhe, C., et al.: Keyword Searching and Browsing in Databases using BANKS. In: ICDE, pp. 431–440 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Peng, Z., Wang, S. (2007). QuickCN: A Combined Approach for Efficient Keyword Search over Databases. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_98
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)