activity
20182025
most citedExtreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products

16 citations · 33 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2019

RAMBO: Repeated And Merged BloOm Filter for Ultra-fast Multiple Set Membership Testing (MSMT) on Large-Scale Data

Gaurav Gupta, Minghao Yan, Benjamin Coleman +4

Multiple Set Membership Testing (MSMT) is a well-known problem in a variety of search and query applications. Given a dataset of K different sets and a query q, it aims to find all…