File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient evaluation of multiple preference queries

TitleEfficient evaluation of multiple preference queries
Authors
KeywordsExperimental evaluation
Individual preference
Iterative process
ITS evaluation
Multiple user
Preference queries
Issue Date2009
PublisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000178
Citation
The 25th IEEE International Conference on Data Engineering (ICDE 2009), Shanghai, China, 29-2 April 2009. In International Conference on Data Engineering Proceedings, 2009, p. 1251-1254 How to Cite?
AbstractConsider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attributes of the searched objects. Although individual preference queries can be evaluated by selecting the object in the database with the highest aggregate score, in the case of multiple requests at the same time, a single object cannot be assigned to more than one users. The challenge is to compute a fair 1-1 matching between the queries and a subset of the objects. We model this as a stable-marriage problem and propose an efficient technique for its evaluation. Our algorithm is an iterative process, which finds at each step the query-object pair with the highest score and removes it from the problem. This is done efficiently by maintaining and matching the skyline of the remaining objects with the remaining queries at each step. An experimental evaluation with synthetic and real data confirms the effectiveness of our method. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/61158
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorU, LHen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorMouratidis, Ken_HK
dc.date.accessioned2010-07-13T03:32:11Z-
dc.date.available2010-07-13T03:32:11Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 25th IEEE International Conference on Data Engineering (ICDE 2009), Shanghai, China, 29-2 April 2009. In International Conference on Data Engineering Proceedings, 2009, p. 1251-1254en_HK
dc.identifier.issn1084-4627en_HK
dc.identifier.urihttp://hdl.handle.net/10722/61158-
dc.description.abstractConsider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attributes of the searched objects. Although individual preference queries can be evaluated by selecting the object in the database with the highest aggregate score, in the case of multiple requests at the same time, a single object cannot be assigned to more than one users. The challenge is to compute a fair 1-1 matching between the queries and a subset of the objects. We model this as a stable-marriage problem and propose an efficient technique for its evaluation. Our algorithm is an iterative process, which finds at each step the query-object pair with the highest score and removes it from the problem. This is done efficiently by maintaining and matching the skyline of the remaining objects with the remaining queries at each step. An experimental evaluation with synthetic and real data confirms the effectiveness of our method. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000178-
dc.relation.ispartofInternational Conference on Data Engineering Proceedingsen_HK
dc.rightsInternational Conference on Data Engineering. Proceedings. Copyright © IEEE Computer Society.-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectExperimental evaluation-
dc.subjectIndividual preference-
dc.subjectIterative process-
dc.subjectITS evaluation-
dc.subjectMultiple user-
dc.subjectPreference queries-
dc.titleEfficient evaluation of multiple preference queriesen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMamoulis, N: nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ICDE.2009.213en_HK
dc.identifier.scopuseid_2-s2.0-67649682495en_HK
dc.identifier.hkuros166367en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67649682495&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1251en_HK
dc.identifier.epage1254en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridMouratidis, K=9637493700en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridU, LH=25647036700en_HK
dc.customcontrol.immutablesml 140526-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats