Review on Keyword Search Over Relational Databases
Chavan Aparna, Suvarna Bangar, M. Tech Scholar · 2014
Keyword search is the most effective information discovery method in documents. The large volume of data is stored in databases. Plain text coexists with structured data, unstructured data for this type of data efficient processing of top-k queries is a crucial requirement. This paper describes fundamental characteristics including relational database, top-k queries, and Steiner trees. Recently, Tuple units are used to improve the keyword search by joining the multiple related tuple units and indexes are used for structural relationships. In this paper various existing techniques for developing search system are described in the literature survey. This survey also describes the Ranking. Ranking queries are dominant in many emerging applications for finding top-k answers. The research strategy used to resolve is top-k query processing.