Secure and Efficient Query Execution on Preference Keyword Search Data

Abstract

Preference aware relational database system is that transparently and efficiently handles queries with different users receive different results based on their personal interests. Preference database employs a preference keyword search knowing the database complicated queries by utilizing user comprises the standard relational operators extended to handle scores and confidences preferences. The conditional part acts as soft constraint that determines which tuples are scored without disqualifying any tuples from the query result. PrefDB separates preference evaluation from tuple filtering. For the first time formalized and solve the problem of effective keyword search over encrypted server data while maintaining keyword privacy. It allows us to define the algebraic properties of the prefer operator and build generic query optimization and processing strategies that are applicable regardless of the type of reference specified in a query or the expected type of answer and  separation is a distinguishing feature of work with respect to previous works.  Keyword search searching inputs exactly match the predefined keywords based on keyword similarity semantics.