<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Wolf-Tilo Balke</style></author><author><style face="normal" font="default" size="100%">Jason Xin Zheng</style></author><author><style face="normal" font="default" size="100%">Ulrich Güntzer</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Approaching the Efficient Frontier: Cooperative Database Retrieval Using High-Dimensional Skylines</style></title><secondary-title><style face="normal" font="default" size="100%">10th International Conference on Database Systems for Advanced Applications (DASFAA 2005)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://www.ifis.cs.tu-bs.de/sites/default/files/biblio/dasfaa05_pdf_39828.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer </style></publisher><pub-location><style face="normal" font="default" size="100%">Beijing, China</style></pub-location><abstract><style face="normal" font="default" size="100%">Cooperative database retrieval is a challenging problem: top k retrieval delivers manageable results only when a suitable compensation function (e.g. a weighted mean) is explicitly given. On the other hand skyline queries offer intuitive querying to users, but result set sizes grow exponentially and hence can easily exceed manageable levels. We show how to combine the advantages of skyline queries and top k retrieval in an interactive query processing scheme using user feedback on a manageable, representative sample of the skyline set to derive most adequate weightings for subsequent focused top k retrieval. Hence, each user’s information needs are conveniently and intuitively obtained, and only a limited set of best matching objects is returned. We will demonstrate our scheme’s efficient performance, manageable result sizes, and representativeness of the skyline. We will also show how to effectively estimate users’ compensation functions using their feedback. Our approach thus paves the way to intuitive and efficient cooperative retrieval with vague query predicates.</style></abstract></record></records></xml>