DBScholar

Back to papers

Fast Set Intersection in Memory

Summary: Linear-space set representations enable k-way intersection in expected O(n/√w + kr) time, exploiting word-level parallelism. A simpler practical variant and the optimal-style algorithm outperform existing methods on synthetic and real workloads. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10446
Venue
VLDB
Year
2011
Pagerank
8.8734284e-05
Overall Rank
2,245 | 84.60%
DOI
10.14778/1938545.1938548

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{ding_vldb11,
        title = {{Fast Set Intersection in Memory}},
        author = {Ding, Bolin and König, Arnd Christian},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {4},
        pages = {255--266},
        doi = {10.14778/1938545.1938548},
        url = {https://doi.org/10.14778/1938545.1938548},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
5 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0010828372
1,717 Improving the Performance of List Intersection 2009 VLDB 9.9327227e-05
Previous Page 1 / 1 Next

Semantically Similar Papers