1 citations · 1 across the 4 of their papers we have counts for
4 papers
C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression
Kepan Zhang, Tiancheng Zhao, Helen Xu
Succinct tries are powerful string dictionaries because of their low memory footprint and fast query performance. However, existing succinct trie implementations face two key chall…
pdGRASS: A Fast Parallel Density-Aware Algorithm for Graph Spectral Sparsification
Tiancheng Zhao, Zekun Yin, Huihai An +4
Graph Spectral Sparsification (GSS) identifies an ultra-sparse subgraph, or sparsifier, whose Laplacian matrix closely approximates the spectral properties of the original graph, e…
Bridging Cache-Friendliness and Concurrency: A Locality-Optimized In-Memory B-Skiplist
Yicong Luo, Senhe Hao, Brian Wheatman +2
Skiplists are widely used for in-memory indexing in many key-value stores, such as RocksDB and LevelDB, due to their ease of implementation and simple concurrency control mechanism…
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
Brian Wheatman, Xiaojun Dong, Zheqi Shen +4
A fundamental building block in any graph algorithm is a graph container - a data structure used to represent the graph. Ideally, a graph container enables efficient access to the…