Database Paper Browser

Back to papers

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)

Paper ID
5656
Venue
SIGMOD
Year
2019
Pagerank
5.7501994e-05
Overall Rank
5,030 | 65.01%
DOI
10.1145/3299869.3314044

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers