DBScholar

Back to papers

Progressive Join Algorithms Considering User Preference

Summary: Introduces ContourJoin, a progressive, preference-aware join algorithm that leverages contour lines to avoid expensive global sorting when delivering user-ordered join results. Empirically outperforms naive blocking and top-k RankJoin in both early-result latency and total computation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
400
Venue
CIDR
Year
2021
Pagerank
5.5052493e-05
Overall Rank
8,024 | 44.95%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ding_cidr21,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '21},
        title = {{Progressive Join Algorithms Considering User Preference}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Ding, Mengsu and Chen, Shimin and Makrynioti, Nantia and Manegold, Stefan},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,593 Beyond Equi-joins: Ranking, Enumeration and Factorization 2021 VLDB 6.1552328e-05
11,312 QPJVis Demo: Quality-boost Progressive Join Query Processing System 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 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