A Method of Computing with Words to Answer Queries in Relational Database

In this paper we are proposing a new method of intelligent search based on the concept of computing with words introduced by Prof. Zadeh[1] in 1996 to find the most suitable match for the predicates to answer any imprecise query made by the database users. The method is based on the theory of Computing with Words (CW). It is also to be mentioned that the proposed method could be easily incorporated in the existing commercial query languages of DBMS to serve the lay users better. So in this Paper Author is suggesting a new method called as α-CWequality Search to answer the queries of Relational database based on ranks.