Sciweavers

777 search results - page 1 / 156
» Optimization of Relational Preference Queries
Sort
View
ADC
2005
Springer
114views Database» more  ADC 2005»
13 years 10 months ago
Optimization of Relational Preference Queries
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...
Bernd Hafenrichter, Werner Kießling
IS
2007
13 years 4 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki
AAAI
2008
13 years 6 months ago
Minimal Contraction of Preference Relations
Changing preferences is very common in real life. The expressive power of the operations of preference change introduced so far in the literature is limited to adding new informat...
Denis Mindolin, Jan Chomicki
CDB
2004
Springer
169views Database» more  CDB 2004»
13 years 10 months ago
Semantic Optimization of Preference Queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). We present here a nu...
Jan Chomicki
EDBTW
2006
Springer
13 years 8 months ago
Preference-Driven Querying of Inconsistent Relational Databases
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...