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
- 7394
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,085 | 29.85%
- 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.00030040036 |
| 388 |
Graph Summarization with Bounded Error |
2008 |
SIGMOD |
0.00024662272 |
| 435 |
Efficient Aggregation for Graph Summarization |
2008 |
SIGMOD |
0.00023260172 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,579 |
Query Preserving Graph Compression |
2012 |
SIGMOD |
0.00011283792 |
| 1,676 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010946423 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 1,973 |
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions |
2018 |
SIGMOD |
9.8913631e-05 |
| 3,009 |
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU |
2020 |
VLDB |
7.7214924e-05 |
| 4,168 |
Accelerating Triangle Counting on GPU |
2021 |
SIGMOD |
6.391271e-05 |
| 4,478 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.1506256e-05 |
| 4,836 |
Making Graphs Compact by Lossless Contraction |
2021 |
SIGMOD |
5.8896897e-05 |
| 4,968 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.7956205e-05 |
| 6,059 |
Cache-Efficient Fork-Processing Patterns on Large Graphs |
2021 |
SIGMOD |
5.2307519e-05 |
| 6,730 |
A Hierarchical Contraction Scheme for Querying Big Graphs |
2022 |
SIGMOD |
4.9479867e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,799 |
CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor |
2024 |
VLDB |
5.3219334e-05 |
| 1,553 |
A Memory Efficient Reachability Data Structure Through Bit Vector Compression |
2011 |
SIGMOD |
0.00011402871 |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 4,494 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1414196e-05 |
| 2,910 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
7.9266529e-05 |
| 10,705 |
Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing |
2025 |
VLDB |
4.1945683e-05 |
| 5,017 |
TurboGraph++: A Scalable and Fast Graph Analytics System |
2018 |
SIGMOD |
5.7574792e-05 |
| 8,398 |
GC: A Graph Caching System for Subgraph/Supergraph Queries |
2018 |
VLDB |
4.5258186e-05 |
| 6,059 |
Cache-Efficient Fork-Processing Patterns on Large Graphs |
2021 |
SIGMOD |
5.2307519e-05 |
| 9,072 |
GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations |
2015 |
VLDB |
4.4024417e-05 |