Back to papers
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries
Summary: GraphTwin stores per-vertex k-bit GT-vectors (independent-set membership) so most non-edges are resolved by in-cache bitwise ANDs (95% in 1 cycle), drastically reducing L3 misses and query latency. Unresolved cases fall back to adjacency lists for exactness; GTWICE is a linear-time heuristic for the NP-hard submodular GT-vector construction.
(summarized by gpt-5-mini on Feb 11 2026)
- Paper ID
- 7395
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,085 | 29.91%
- DOI
-
10.1145/3769798
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030020929 |
| 387 |
Graph Summarization with Bounded Error |
2008 |
SIGMOD |
0.00024682268 |
| 435 |
Efficient Aggregation for Graph Summarization |
2008 |
SIGMOD |
0.00023268266 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,572 |
Query Preserving Graph Compression |
2012 |
SIGMOD |
0.00011296109 |
| 1,670 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010944596 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 1,973 |
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions |
2018 |
SIGMOD |
9.8834701e-05 |
| 2,933 |
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU |
2020 |
VLDB |
7.8633648e-05 |
| 4,146 |
Accelerating Triangle Counting on GPU |
2021 |
SIGMOD |
6.4065776e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1452192e-05 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,030 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
5.7445683e-05 |
| 5,966 |
Cache-Efficient Fork-Processing Patterns on Large Graphs |
2021 |
SIGMOD |
5.2471834e-05 |
| 7,179 |
A Hierarchical Contraction Scheme for Querying Big Graphs |
2022 |
SIGMOD |
4.803776e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,811 |
CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor |
2024 |
VLDB |
5.3168243e-05 |
| 1,551 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011395294 |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 4,486 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1413967e-05 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |
| 10,713 |
Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing |
2025 |
VLDB |
4.1905499e-05 |
| 5,014 |
TurboGraph++: A Scalable and Fast Graph Analytics System |
2018 |
SIGMOD |
5.7519428e-05 |
| 8,395 |
GC: A Graph Caching System for Subgraph/Supergraph Queries |
2018 |
VLDB |
4.5214792e-05 |
| 5,966 |
Cache-Efficient Fork-Processing Patterns on Large Graphs |
2021 |
SIGMOD |
5.2471834e-05 |
| 9,070 |
GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations |
2015 |
VLDB |
4.3982218e-05 |