EMBANKS: Towards Disk Based Algorithms for Keyword-Search in Structured Databases
In recent years, there has been a lot of interest in the field of keyword querying relational databases. A variety of systems such as DBXplorer, Discover and ObjectRank have been proposed. Another such system is BANKS, which enables data and schema browsing together with keyword-based search for relational databases. It models tuples as nodes in a graph, connected by links induced by foreign key and other relationships. The size of the database graph that BANKS uses is proportional to the sum of the number of nodes and edges in the graph. Systems such as SPIN, which search on Personal Information Networks and use BANKS as the backend, maintain a lot of information about the users' data.