Computing the top-k maximal answers in a join of ranked lists.

Mirit Shalem|Yaron Kanza


Anthology ID:DBLP:conf/cikm/ShalemK10
Volume:Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010
Year:2010
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1381-1384
URL:https://doi.org/10.1145/1871437.1871626
DOI:https://doi.org/10.1145/1871437.1871626
DBLP:conf/cikm/ShalemK10
BibTeX:
@inproceedings{shalem-2010-computing, author = {Mirit Shalem and Yaron Kanza}, editor = {Jimmy Huang and Nick Koudas and Gareth J. F. Jones and Xindong Wu and Kevyn Collins-Thompson and Aijun An}, title = {{Computing the top-k maximal answers in a join of ranked lists}}, booktitle = {{Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010}}, pages = {1381--1384}, publisher = {ACM}, year = {2010}, url = {https://doi.org/10.1145/1871437.1871626}, doi = {https://doi.org/10.1145/1871437.1871626} }