1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2017★ 1 cited
SF-sketch: A Two-stage Sketch for Data Streams
Tong Yang, Lingtong Liu, Yibo Yan +5
A sketch is a probabilistic data structure used to record frequencies of items in a multi-set. Sketches are widely used in various fields, especially those that involve processing…