Trends in rank join

Authors:
Ihab Ilyas;Davide Martinenghi;Neoklis Polyzotis;Marco Tagliasacchi
Affiliations:
University of Waterloo;Politecnico di Milano;University of California, Santa Cruz;Politecnico di Milano
Venue:
Search computing
Year:
2011

Citing 5
Cited 0

Supporting top-K join queries in relational databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A survey of top-k query processing techniques in relational database systems

ACM Computing Surveys (CSUR)
Robust and efficient algorithms for rank join evaluation

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Supporting ranking queries on uncertain and incomplete data

The VLDB Journal — The International Journal on Very Large Data Bases
Proximity rank join

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

This chapter reports the main findings of a panel that was moderated by Davide Martinenghi in which Ihab Ilyas, Neoklis Polyzotis, and Marco Tagliasacchi shared their thoughts with the attendees of the Second SeCo Workshop regarding current and future issues related to what was presented during the session on rank join. The topics touched upon during the discussion regarded relevance for Search Computing, pertinence of optimization, multi-way joins, approximate answers, and uncertainty.