@inproceedings{dong2009overview,
  author = {Dong, Xishuang and Chen, Xiaodong and Guan, Yi and Yu, Zhiming and Li, Sheng},
  booktitle = {CSIE (3)},
  crossref = {conf/csie/2009},
  editor = {Burgin, Mark and Chowdhury, Masud H. and Ham, Chan H. and Ludwig, Simone A. and Su, Weilian and Yenduri, Sumanth},
  ee = {http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.1090},
  interhash = {038285e30e929088afad8d82c066ef75},
  intrahash = {d970cfabe05f5e19100099afa11b9873},
  isbn = {978-0-7695-3507-4},
  pages = {600-606},
  publisher = {IEEE Computer Society},
  title = {An Overview of Learning to Rank for Information Retrieval.},
  url = {http://dblp.uni-trier.de/db/conf/csie/csie2009-3.html#DongCGYL09},
  year = 2009
}

@inproceedings{citeulike:2801543,
  abstract = {: Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under that attribute, sorted by grade (highest grade first). There is some monotone aggregation function, or combining rule, such as min or average, that combines the individual grades to obtain an...},
  author = {Fagin, Ronald and Lotem, Amnon and Naor, Moni},
  booktitle = {Symposium on Principles of Database Systems},
  citeulike-article-id = {2801543},
  interhash = {8bbc6d283a09e8ec8c082496b2f25865},
  intrahash = {5fae1d60624767e4b3dea4d1a985cf7c},
  posted-at = {2008-05-15 13:57:01},
  priority = {0},
  title = {Optimal Aggregation Algorithms for Middleware},
  url = {http://citeseer.ist.psu.edu/441654.html},
  year = 2001
}