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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Can Lu (Guangdong University of Technology)
- 2. Sijin Wang (Guangdong University of Technology)
- 3. Wenxuan Deng (Guangdong University of Technology)
- 4. Xinyu Li (Guangdong University of Technology)
- 5. Yikai Zhang (Guangdong University of Technology)
- 6. Jeffrey Xu Yu (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{lu_sigmod26,
title = {{GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries}},
author = {Lu, Can and Wang, Sijin and Deng, Wenxuan and Li, Xinyu and Zhang, Yikai and Yu, Jeffrey Xu},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769798},
url = {https://dl.acm.org/doi/10.1145/3769798},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,075 | CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor | 2024 | VLDB |
| 2 | 1,301 | A Memory Efficient Reachability Data Structure Through Bit Vector Compression | 2011 | SIGMOD |
| 3 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 4 | 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 5 | 2,119 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD |
| 6 | 10,950 | Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing | 2025 | VLDB |
| 7 | 4,323 | TurboGraph++: A Scalable and Fast Graph Analytics System | 2018 | SIGMOD |
| 8 | 8,382 | GC: A Graph Caching System for Subgraph/Supergraph Queries | 2018 | VLDB |
| 9 | 5,612 | Cache-Efficient Fork-Processing Patterns on Large Graphs | 2021 | SIGMOD |
| 10 | 9,218 | GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations | 2015 | VLDB |