Abstract
This paper surveys research on enabling keyword search in relational databases. We present fundamental characteristics and discuss research dimensions, including data representation, ranking, efficient processing, query representation, and result presentation. Various approaches for developing the search system are described and compared within a common framework. We discuss the evolution of new research strategies to resolve the issues associated with probabilistic models, efficient top-k query processing, and schema analysis in relational databases.
Similar content being viewed by others
References
Agrawal S, Chaudhuri S, Das G (2002) DBXplorer: a system for keyword-based search over relational databases. In: Proceedings of the 18th international conference on data engineering, pp 5–17, February 26–March 01, 2002, San Jose, California, USA
Balmin A, Hristidis V, Papakonstantinou Y (2004) ObjectRank: authority-based keyword search in databases. In: Proceedings of the 30th international conference on very large data bases, pp 564–575, August 31–September 03, 2004, Toronto, Canada
Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th international conference on world wide web, pp 107–117, April 01–07, 1998, Brisbane, Australia
Calado P, da Silva AS, Vieira RC, Laender AHF, Ribeiro-Neto BA (2002) Searching web databases by structuring keyword-based queries. In: Proceedings of the 11th international conference on information and knowledge management, pp 26–33, November 04–09, McLean, Virginia, USA
Chaudhuri S, Das G, Hristidis V, Weikum G (2003) Automated ranking of database query results. In: First Biennial Conference on Innovative Data Systems Research, pp 888–899, January 5–8, 2003, Asilomar, California, USA
Chaudhuri S, Das G, Hristidis V, Weikum G (2004) Probabilistic ranking of database query results. In: Proceedings of the 30th international conference on very large data bases, pp 888–899, August 31–September 03, 2004, Toronto, Canada
Dar S, Entin G, Geva S, Palmon E (1998) DTL’s dataspot: database exploration using plain language. In: Proceedings of the 24th international conference on very large data bases, pp 645–649, August 24–27, 1998, San Francisco, California, USA
Ding B, Yu JX, Wang S, Qin L, Zhang X, Lin X (2007) Finding Top-k min-cost connected trees in databases. In: Proceedings of the IEEE 23th international conference on data engineering, pp 836–845, April 17–20, 2007, Istanbul, Turkey
Ghanem TM, Aref WG (2004) Database deepen the web. Computer 37(1): 116–117
Goldman R, Shivakumar N, Venkatasubramanian S, Garcia-Molina H (1998) Proximity search in databases. In: Proceedings of the 24th international conference on very large data bases, pp 26–37, August 24–27, 1998, San Francisco, California, USA
He H, Wang H, Yang J, Yu PS (2007) BLINKS: ranked keyword searches on graphs. In: Proceedings of the 2007 ACM SIGMOD international conference on management of data, pp 305–316, June 11–14, 2007, Beijing, China
Hristidis V, Koudas N, Papakonstantinou Y (2001) PREFER: a system for the efficient execution of multi-parametric ranked queries. SIGMOD Record 30(2): 259–270
Hristidis V, Papakonstantinou Y (2002) DISCOVER: keyword search in relational databases. In: Proceedings of the 28th international conference on very large data bases, pp 670–681, August 20–23, 2002, Hong Kong, China
Hristidis V, Gravano L, Papakonstantinou Y (2003) Efficient IR-style keyword search over relational databases. In: Proceedings of the 29th international conference on very large data bases, pp 850–861, September 9–12, 2003, Berlin, Germany
Hristidis V, Hwang H, Papakonstantinou Y (2008) Authority-based keyword search in databases. ACM Trans Database Syst 33(1): 1–40
Hulgeri A, Nakhe C (2002) Keyword searching and browsing in databases using BANKS. In: Proceedings of the 18th international conference on data engineering, pp 431–441, February 26–March 01, 2002, San Jose, California, USA
Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem, annals of discrete mathematics, vol 53. Elsevier/North-Holland, Amsterdam
Ilyas IF, Aref WG, Elmagarmid AK (2003) Supporting top-K join queries in relational databases. In: Proceedings of the 29th international conference on very large data bases, pp 754–765, September 9–12, 2003, Berlin, Germany
Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H (2005) Bidirectional expansion for keyword search on graph databases. In: Proceedings of the 31th international conference on very large data bases, pp 505–516, August 30–September 02, 2005, Trondheim, Norway
Korth HF, Silberschatz A (1986) Database system concepts. McGraw-Hill, Inc., New York
Li W-S, Candan KS, Vu Q, Agrawal D (2001) Retrieving and organizing web pages by information unit. In: Proceedings of the 10th international conference on world wide web, pp 230–244, May 01–05, 2001, Hong Kong, China
Li G, Ooi BC, Feng J, Wang J, Zhou L (2008) EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 903–914, June 9–12, 2008, Vancouver, Canada
Liu F, Yu C, Meng W, Chowdhury A (2006) Effective keyword search in relational databases. In: Proceedings of the 2006 ACM SIGMOD international conference on management of data, pp 563–574, June 27–29, 2006, Chicago, Illinois, USA
Luo Y, Lin X, Wang W, Zhou X (2007) SPARK: Top-k keyword query in relational databases. In: Proceedings of the 2007 ACM SIGMOD international conference on management of data, pp 115–126, June 11–14, 2007, Beijing, China
Manning CD, Raghavan P, Schutze H (2008) Introduction to information retrieval. Cambridge University Press, Cambridge
Mesquita F, da Silva AS, de Moura ES, Calado P, Laender AHF (2007) LABRADOR: efficiently publishing relational databases on the web by using keyword-based query interfaces. Inform Process Manage 43(4): 983–1004
Natsev A, Chang Y-C, Smith JR, Li C-S, Vitter JS (2001) Supporting incremental join queries on ranked inputs. In: Proceedings of the 27th international conference on very large data bases, pp 281–290, September 11–14, 2001, Roma, Italy
Tong H, Faloutsos C, Pan J-Y (2008) Random walk with restart: fast solutions and applications. Knowl Inform Syst 14(3): 327–346
Wan X (2008) Beyond topical similarity: a structural similarity measure for retrieving highly similar documents. Knowl Inform Syst 15(1): 55–73
Wang S, Zhang K-L (2005) Searching databases with keywords. J Comput Sci Technol 20(1): 55–62
Wang S, Peng Z, Zhang J, Qin L, Wang S, Yu JX, Ding B (2006) NUITS: a novel user interface for efficient keyword search over databases. In: Proceedings of the 32th international conference on very large data bases, pp 1143–1146, September 12–15, 2006, Seoul, Korea
Wang Z, Wang Q, Wang D-W (2009) Bayesian network based business information retrieval model. Knowl Inform Syst 20(1): 63–79
Zhang J, Peng Z-H, Wang S, Nie H-J (2007) CLASCN: candidate network selection for efficient top-k keyword queries over databases. J Comput Sci Technol 22(2): 197–207
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Park, J., Lee, Sg. Keyword search in relational databases. Knowl Inf Syst 26, 175–193 (2011). https://doi.org/10.1007/s10115-010-0284-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-010-0284-1