4 citations · 5 across the 5 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2021★ 1 cited
MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in Distance
Huayi Wang, Jingfan Meng, Long Gong +2
Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic problem, with numerous applications in many areas of computer science. Locality-sensitive hashing (LSH) is o…
cs.DB2020
Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Long Gong, Ziheng Liu, Liang Liu +3
Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitco…