Add to ORKGPreferences allow more flexible and personalised queries in database systems. Evaluation of such a query means to select the maximal elements from the respective database w.r.t. to the preference, which is a partial strict-order. We present a point-free calculus of such preferences and exemplify its use in proving algebraic laws about preferences that can be used in query optimisation. We show that this calculus can be mechanised using off-the-shelf automated first-order theorem provers
Traditional database query languages such as Datalog and SQL allow the user to specify only mandator...
The paper presents a new approach to database preferences queries, where preferences are represented...
In recent years, the database community has paid increasing attention to the formulation and treatm...
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a q...
Preference algebra, an extension of the algebra of database relations, is a well-studied field in th...
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a q...
The design and implementation of advanced personalized database applications requires a preference-d...
Personalization of e-services poses new challenges to database technology. In particular, a powerful...
Relational methods in computer science have been studied intensively in the last decades, especially...
Personalization of Web services requires a powerful preference model that smoothly and efficiently i...
Many important applications, e.g. planning tasks, de-mand the flexible and efficient use of personal...
Abstract—In implementing preference-aware query processing, a straightforward option is to build a p...
Deep personalization of database queries requires a semantically rich, easy to handle and flexible p...
Personalization is a topic which receives an increasing interest in information technology. The majo...
In many applications, it may be natural to express not only mandatory requirements but also preferen...
Traditional database query languages such as Datalog and SQL allow the user to specify only mandator...
The paper presents a new approach to database preferences queries, where preferences are represented...
In recent years, the database community has paid increasing attention to the formulation and treatm...
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a q...
Preference algebra, an extension of the algebra of database relations, is a well-studied field in th...
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a q...
The design and implementation of advanced personalized database applications requires a preference-d...
Personalization of e-services poses new challenges to database technology. In particular, a powerful...
Relational methods in computer science have been studied intensively in the last decades, especially...
Personalization of Web services requires a powerful preference model that smoothly and efficiently i...
Many important applications, e.g. planning tasks, de-mand the flexible and efficient use of personal...
Abstract—In implementing preference-aware query processing, a straightforward option is to build a p...
Deep personalization of database queries requires a semantically rich, easy to handle and flexible p...
Personalization is a topic which receives an increasing interest in information technology. The majo...
In many applications, it may be natural to express not only mandatory requirements but also preferen...
Traditional database query languages such as Datalog and SQL allow the user to specify only mandator...
The paper presents a new approach to database preferences queries, where preferences are represented...
In recent years, the database community has paid increasing attention to the formulation and treatm...