Welcome to D
SIGMOD 2005
PODS 2005
SIGMOD-RECOR
CIDR 2005
CIKM 2005
COMAD 2005
CVDB 2005
DaMoN 2005
Data Enginee
DEBS05
DMSN 2005
DOLAP 2005
GIR 2005
GIS 2005
Hypertext 20
ICDE 2005
<<< = ICDE'05 Pape>>>
ICDM 2005
IHIS 2005
IQIS 2005
JCDL 2005
KRAS 2005
MDM 2005
MIR 2005
MobiDE 2005
P2PIR 2005
RIDE 2005
SBBD 2005
SIGIR 2005
SIGIR-FORUM
SIGKDD 2005
SIGKDD-EXP
SSDBM 2005
TIME 2005
TKDE 2005
TODS 2005
VLDB 2005
VLDBJ 2005
WebDB 2005
WIDM 2005

RankFP: a framework for supporting rank formulation and processing


Hwanjo Yu, Seung-won Hwang, and Kevin Chen-Chuan Chang

  View Paper (PDF)  

Return to Research Session 15: Query Processing


Abstract

To enable ad-hoc ranking for data retrieval, we observe two major barriers: first, usability: ad-hoc ranking should be "user friendly", for ordinary users to easily specify their ranking criteria. Second, efficiency: ad-hoc ranking should be "database friendly", to be amenable to efficient processing. This paper proposes a new framework such that: 1) to achieve usability, it allows users to qualitatively and intuitively express their preferences by partial orders on selected examples, from which it effectively learns a quantitative global ranking function, and (2) to achieve efficiency, it integrates the front-end machine learner with a back-end top-k query processor to evaluate the learned functions. First, to support efficient query processing, our framework assumes the score-based ranking model. Such a model is both expressive and amenable to efficient query processing.


©2006 Association for Computing Machinery