DBScholar

Back to papers

Supporting Top-k Join Queries in Relational Databases

Summary: Rank-join algorithm exploits input orders to produce top-k join results under a user-specified score, ranking during join. Two nonblocking, ripple-join-based operators are integrated in pipelines; a PREDATOR prototype demonstrates superior performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9212
Venue
VLDB
Year
2003
Pagerank
0.00017220967
Overall Rank
509 | 96.51%
DOI
10.1016/B978-012722442-8/50072-0

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{ilyas_vldb03,
        title = {{Supporting Top-k Join Queries in Relational Databases}},
        author = {Ilyas, Ihab F. and Aref, Walid G. and Elmagarmid, Ahmed K.},
        journal = {PVLDB},
        series = {{VLDB} '03},
        doi = {10.1016/B978-012722442-8/50072-0},
        url = {https://doi.org/10.1016/B978-012722442-8/50072-0},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 51 citing papers.

Rank Citing Paper Year Venue Pagerank
12,494 Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval 2009 SIGMOD 5.093636e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers