Database Paper Browser

Back to papers

Fast Set Intersection in Memory

Summary: Linear-space in-memory set representations enable fast intersections. For k preprocessed sets of total size n, intersection runs in expected time O(n/√w + k r); a simpler variant favors practical speed with weaker guarantees, both beating state-of-the-art on synthetic and real workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10255
Venue
VLDB
Year
2011
Pagerank
8.7524354e-05
Overall Rank
2,464 | 82.86%
DOI
-

Incoming Non-self Citations Over Time

Authors

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
7 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0015496097
1,124 Improving the Performance of List Intersection 2009 VLDB 0.00013847565
Previous Page 1 / 1 Next

Semantically Similar Papers