Skyline Queries for Preference-Based Information Systems.

摘要: Cooperative database retrieval is a challenging problem. In today‟s information systems instead of just retrieving all objects from databases that exactly match user‟s query, often set best matching the query attributes desired. Starting individual user preferences for each attribute, can be relaxed step by until satisfying result returned. This avoids notorious empty effect over-specified queries, while still respecting wishes. The prime paradigm this kind are skyline where Pareto optimal with respect to (partial-order) attribute price cooperative behavior however usually large size. decision scenario, like e.g., product search in e-commerce applications, users thus have choose alternatives alternative described list predefined attributes. task pick having highest value personal among alternatives. For example, if one looking new car, car offer terms price, top speed, make, and many further Preferences may consist simple statements “I want fast car”, pay as little possible, definitely at most € 30.000”, or don't mind whether color red blue, but it should not black.” Since there no brand-new Ferrari free, faced getting complicated. Multi-criteria optimization discipline deals problems above. Unfortunately, although several decades old now, seem method available provides both high quality easiness use. Only too proposed methods work on complex utility functions cannot provided an intuitive way. An important goal current research therefore develop determine „optimal‟ choice selections return reasonably small sets user. H. Hopfner, F. Klan (Eds.): Proceedings 20. GI-Workshop Foundations Databases (GvDB), Apolda, Thuringen, Germany, May 13-16, 2008.