The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2002)
San Jose, California
Feb. 26, 2002 to Mar. 1, 2002
ISBN: 0-7695-1531-2
pp: 0431
ABSTRACT
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of query languages; even relatively simple query languages designed for non-experts are too complicated for them. We describe BANKS, a system which enables keyword-based search on relational databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowledge of the schema or any need for writing complex queries. A user can get information by typing a few keywords, following hyperlinks, and interacting with controls on the displayed results.BANKS models tuples as nodes in a graph, connected by links induced by foreign key and other relationships. Answers to a query are modeled as rooted trees connecting tuples that match individual keywords in the query. Answers are ranked using a notion of proximity coupled with a notion of prestige of nodes based on inlinks, similar to techniques developed for Web search. We present an efficient heuristic algorithm for finding and ranking query results.
INDEX TERMS
keyword searching, web, publishing data, database browsing
CITATION
Charuta Nakhe, Gaurav Bhalotia, I.I.T. Bombay, Soumen Chakrabarti, S. Sudarshan, Arvind Hulgeri, "Keyword Searching and Browsing in Databases using BANKS", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 0431, 2002, doi:10.1109/ICDE.2002.994756
90 ms
(Ver 3.3 (11022016))