3 papers
cs.DB2023
The SpaceSaving Family of Algorithms for Data Streams with Bounded Deletions
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi +3
In this paper, we present an advanced analysis of near optimal algorithms that use limited space to solve the frequency estimation, heavy hitters, frequent items, and top-k approxi…
cs.DB2021
SpaceSaving: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi +1
In this paper, we propose the first deterministic algorithms to solve the frequency estimation and frequent item problems in the bounded deletion model. We establish the space lowe…
cs.IR2019
Scalable Similarity Joins of Tokenized Strings
Ahmed Metwally, Chun-Heng Huang
This work tackles the problem of fuzzy joining of strings that naturally tokenize into meaningful substrings, e.g., full names. Tokenized-string joins have several established appl…