4 papers · 1 filter
Fast Construction of Learned Count-Min Sketch via Ternary Search
Ryusuke Inami, Yusuke Matsui
The Learned Count-Min Sketch (LCMS) is a learned data structure that estimates element frequencies in a multiset and has been experimentally shown to outperform classical data stru…
PCF Learned Sort: a Learning Augmented Sort Algorithm with Expected Complexity
Atsuki Sato, Yusuke Matsui
Sorting is one of the most fundamental algorithms in computer science. Recently, Learned Sorts, which use machine learning to improve sorting speed, have attracted attention. While…
Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
Atsuki Sato, Yusuke Matsui
Recent studies have demonstrated that learned Bloom filters (LBFs), which combine machine learning with the classical Bloom filter, can achieve superior memory efficiency. However,…
Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
Atsuki Sato, Yusuke Matsui
Bloom filter is a widely used classic data structure for approximate membership queries. Learned Bloom filters improve memory efficiency by leveraging machine learning, with the pa…