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

Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang. Progressive and selective merge: computing top-k with ad-hoc ranking functions. In Chee Yong Chan, Beng Chin Ooi, Aoying Zhou, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007. pages 103-114, ACM, 2007. [doi]

@inproceedings{XinHC07,
  title = {Progressive and selective merge: computing top-k with ad-hoc ranking functions},
  author = {Dong Xin and Jiawei Han and Kevin Chen-Chuan Chang},
  year = {2007},
  doi = {10.1145/1247480.1247494},
  url = {http://doi.acm.org/10.1145/1247480.1247494},
  researchr = {https://researchr.org/publication/XinHC07},
  cites = {0},
  citedby = {0},
  pages = {103-114},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007},
  editor = {Chee Yong Chan and Beng Chin Ooi and Aoying Zhou},
  publisher = {ACM},
  isbn = {978-1-59593-686-8},
}