Nanosecond Indexing of Graph Data With Hash Maps and VLists
Summary: Wait-free, multi-reader, single-writer graph indexing using hash maps and VLists; kill-9 durable, no reader-to-writer communication, enabling isolation and read scalability. Online updates preserve availability; 80 ns for small subgraph lookups, 12 ns per edge for materialization, 7 bytes/edge/index, ~1M online writes/sec. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Andrew Carter (LinkedIn)
- 2. Andrew Rodriguez (LinkedIn)
- 3. Yiming (Ann) Yang (LinkedIn)
- 4. Scott Meyer (LinkedIn)
BibTeX Citation
@inproceedings{carter_sigmod19,
title = {{Nanosecond Indexing of Graph Data With Hash Maps and VLists}},
author = {Carter, Andrew and Rodriguez, Andrew and Yang, Yiming (Ann) and Meyer, Scott},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3314044},
url = {https://dl.acm.org/doi/10.1145/3299869.3314044},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,281 | LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans | 2020 | VLDB | 0.00011218311 |
| 3,115 | RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s | 2021 | SIGMOD | 7.6315625e-05 |
| 3,973 | A1: A Distributed In-Memory Graph Database | 2020 | SIGMOD | 6.8852453e-05 |
| 8,254 | Bouncer: Admission Control with Response Time Objectives for Low-latency Online Data Systems | 2024 | SIGMOD | 5.3666042e-05 |
| 8,334 | Revisiting the Design of In-Memory Dynamic Graph Storage | 2025 | SIGMOD | 5.3514855e-05 |
| 11,141 | RedTAO: A Trillion-edge High-throughput Graph Store | 2025 | SIGMOD | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012087459 |
| 6 | Pig Latin: A Not-So-Foreign Language for Data Processing | 2008 | SIGMOD | 0.0010515896 |
| 376 | Scalable Semantic Web Data Management Using Vertical Partitioning | 2007 | VLDB | 0.0001961765 |
| 445 | Trinity: A Distributed Graph Engine on a Memory Cloud | 2013 | SIGMOD | 0.00018168823 |
| 512 | Scalable SPARQL Querying of Large RDF Graphs | 2011 | VLDB | 0.00017053842 |
| 557 | Hexastore: Sextuple Indexing for Semantic Web Data Management | 2008 | VLDB | 0.00016489266 |
| 1,601 | SQLGraph: An Efficient Relational-Based Property Graph Store | 2015 | SIGMOD | 0.00010107506 |
| 8,633 | Optimizing Schema-Last Tuple-Store Queries in Graphd | 2010 | SIGMOD | 5.2972057e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,687 | RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage | 2026 | SIGMOD |
| 2 | 3,155 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |
| 3 | 6,121 | LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR | 2024 | SIGMOD |
| 4 | 8,651 | Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs | 2025 | SIGMOD |
| 5 | 10,715 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |
| 6 | 2,363 | Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing | 2013 | VLDB |
| 7 | 4,454 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD |
| 8 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 9 | 9,809 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB |
| 10 | 330 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD |