PREFDB: SUPPORTING PREFERENCES AS FIRST-CLASS CITIZENS IN RELATIONAL DATABASES

Abstract

In this paper, we tend to argue that preference-aware question process must be pushed nearer to the package. We tend to introduce a preference-aware relative information model that extends tuples with preferences associate degreed an extended pure mathematics that captures the essence of process queries with preferences. Supported a group of pure mathematics properties and a value model that we tend to propose, we offer many question optimization methods for extended question plans. Further, we tend to describe execution algorithmic rule that blends preference analysis with query execution, whereas creating effective use of the native question engine. We’ve got enforced our framework and strategies in an exceedingly paradigm system, PrefDB. PrefDB permits clear and economical analysis of advantageous queries on prime of a relative package
Keywords: Group Bottom Up, Structure Query Language.