Progressive and selective merge: computing top-k with ad-hoc ranking functions

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/sigmod/XinHC07, title={Progressive and selective merge: computing top-k with ad-hoc ranking functions}, pages={103-114}, year={2007}, crossref={DBLP:conf/sigmod/2007}, booktitle={SIGMOD Conference}, ee={http://doi.acm.org/10.1145/1247480.1247494}, url={http://www.informatik.uni-trier.de/~ley/db/conf/sigmod/sigmod2007.html#XinHC07}, author={Dong Xin and Jiawei Han and Kevin Chen-Chuan Chang} }\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/Progressive_and_selective_merge:_computing_top-k_with_ad-hoc_ranking_functions"
Personal tools