Back to papers
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions
Summary: Presents QFilter, a SIMD-accelerated set-intersection for graph adjacency lists using a merge-based scheme with one-byte pruning. With BSR, a compact binary set representation, it achieves two-level data parallelism; node ordering is NP-hard, tackled by a practical approximate algorithm and experiments.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5570
- Venue
- SIGMOD
- Year
- 2018
- Pagerank
- 9.8913631e-05
- Overall Rank
- 1,973 | 86.28%
- DOI
-
10.1145/3183713.3196924
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,138 |
Traversing Large Graphs on GPUs with Unified Memory |
2020 |
VLDB |
0.00013727765 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 4,168 |
Accelerating Triangle Counting on GPU |
2021 |
SIGMOD |
6.391271e-05 |
| 6,001 |
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra |
2021 |
VLDB |
5.2415551e-05 |
| 7,320 |
Accelerating Maximal Clique Enumeration via Graph Reduction |
2024 |
VLDB |
4.7629325e-05 |
| 7,804 |
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs |
2021 |
VLDB |
4.6466513e-05 |
| 8,267 |
Revisiting the Design of In-Memory Dynamic Graph Storage |
2025 |
SIGMOD |
4.545679e-05 |
| 9,173 |
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs |
2024 |
SIGMOD |
4.3842827e-05 |
| 10,037 |
The Power of Core Clique Removal for Exact Clique Enumeration |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,688 |
RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries |
2025 |
VLDB |
4.1945683e-05 |
| 10,863 |
Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment |
2025 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1945683e-05 |
| 8,252 |
A Generic Flow Algorithm for Shared Filter Ordering Problems |
2008 |
PODS |
4.5497007e-05 |
| 6,867 |
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection |
2017 |
PODS |
4.9025083e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 1,676 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010946423 |
| 4,522 |
GPU-based Graph Traversal on Compressed Graphs |
2019 |
SIGMOD |
6.1146374e-05 |
| 2,464 |
Fast Set Intersection in Memory |
2011 |
VLDB |
8.7524354e-05 |
| 1,124 |
Improving the Performance of List Intersection |
2009 |
VLDB |
0.00013847565 |
| 9,173 |
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs |
2024 |
SIGMOD |
4.3842827e-05 |
| 3,448 |
Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions |
2015 |
VLDB |
7.0844401e-05 |