Practical preference relations for large data sets

Kenneth A. Ross, Peter J. Stuckey, Amelie Marian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that specification to give more prominence to preferred answers. We study constraint formalisms for expressing user preferences as base facts in a partial order. We consider a language that allows comparison and a limited form of arithmetic, and show that the transitive closure computation required to complete the partial order terminates. We consider various ways of composing partial orders from smaller pieces, and provide results on the size of the resulting transitive closures. Finally, we show how preference queries within our language can be supported by suitable index structures for efficient evaluation over large data sets. Our results provide guidance about when complex preferences can be efficiently evaluated, and when they cannot.

Original languageEnglish (US)
Title of host publicationWorkshops in Conjunction with the International Conference on Data Engineering - ICDE' 07
Pages229-236
Number of pages8
DOIs
StatePublished - 2007
EventWorkshops in Conjunction with the 23rd International Conference on Data Engineering - ICDE 2007 - Istanbul, Turkey
Duration: Apr 15 2007Apr 20 2007

Publication series

NameProceedings - International Conference on Data Engineering
ISSN (Print)1084-4627

Other

OtherWorkshops in Conjunction with the 23rd International Conference on Data Engineering - ICDE 2007
Country/TerritoryTurkey
CityIstanbul
Period4/15/074/20/07

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Fingerprint

Dive into the research topics of 'Practical preference relations for large data sets'. Together they form a unique fingerprint.

Cite this