DBScholar

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
5718
Venue
SIGMOD
Year
2019
Pagerank
6.555048e-05
Overall Rank
4,701 | 67.75%
DOI
10.1145/3299869.3314044

Incoming Non-self Citations Over Time

Authors

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.

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