The paper introduces BANKS, a system designed to enable keyword-based search and browsing in relational databases. BANKS allows users to extract information without needing to know the schema or write complex queries. It models tuples as nodes in a graph, connected by links induced by foreign keys and other relationships. Answers to queries are represented as rooted trees connecting tuples that match individual keywords. The relevance of these trees is ranked using a combination of proximity and node prestige, similar to techniques used in Web search. The paper presents an efficient heuristic algorithm for finding and ranking query results. BANKS is implemented in Java using servlets and JDBC, and can be run on any schema without programming. The system supports various browsing features, such as hyperlinks, projections, selections, and joins, and can be used for publishing organizational, bibliographic, and electronic catalog data. The authors evaluate BANKS using academic and bibliographic databases, demonstrating its practicality and effectiveness in handling moderately large databases.The paper introduces BANKS, a system designed to enable keyword-based search and browsing in relational databases. BANKS allows users to extract information without needing to know the schema or write complex queries. It models tuples as nodes in a graph, connected by links induced by foreign keys and other relationships. Answers to queries are represented as rooted trees connecting tuples that match individual keywords. The relevance of these trees is ranked using a combination of proximity and node prestige, similar to techniques used in Web search. The paper presents an efficient heuristic algorithm for finding and ranking query results. BANKS is implemented in Java using servlets and JDBC, and can be run on any schema without programming. The system supports various browsing features, such as hyperlinks, projections, selections, and joins, and can be used for publishing organizational, bibliographic, and electronic catalog data. The authors evaluate BANKS using academic and bibliographic databases, demonstrating its practicality and effectiveness in handling moderately large databases.