16 citations · 16 across the 2 of their papers we have counts for
4 papers
G-Tran: Making Distributed Graph Transactions Fast
Hongzhi Chen, Changji Li, Chenguang Zheng +4
Graph transaction processing raises many unique challenges such as random data access due to the irregularity of graph structures, low throughput and high abort rate due to the rel…
Norm-Ranging LSH for Maximum Inner Product Search
Xiao Yan, Jinfeng Li, Xinyan Dai +2
Neyshabur and Srebro proposed Simple-LSH, which is the state-of-the-art hashing method for maximum inner product search (MIPS) with performance guarantee. We found that the perform…
Scalable De Novo Genome Assembly Using Pregel
Da Yan, Hongzhi Chen, James Cheng +2
De novo genome assembly is the process of stitching short DNA sequences to generate longer DNA sequences, without using any reference sequence for alignment. It enables high-throug…
G-thinker: Big Graph Mining Made Easier and Faster
Da Yan, Hongzhi Chen, James Cheng +3
This paper proposes a general system for compute-intensive graph mining tasks that find from a big graph all subgraphs that satisfy certain requirements (e.g., graph matching and c…