HashGraph uses sparse graph representations to construct hash tables that handle arbitrary collisions and load factors with claimed 2.5B keys/sec build rates on GPUs, outperforming cuDPP and cuDF.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure
HashGraph uses sparse graph representations to construct hash tables that handle arbitrary collisions and load factors with claimed 2.5B keys/sec build rates on GPUs, outperforming cuDPP and cuDF.