STEM^2: A Fast and Space-efficient Data Structure for Exact Multi-Set Membership Queries
Summary: STEM² provides exact, dynamic multiset membership via a balanced tree of Exact Binary Set Separators, avoiding filter false positives with compact space. A control/data-plane split and two-hash lookups enable 120+ Mops, outperforming Cuckoo filters and Ludo hashing. (summarized by gpt-5.6-luna on Aug 17 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yannian Niu (University of Connecticut)
- 2. Song Han (University of Connecticut)
- 3. Minmei Wang (University of Connecticut)
BibTeX Citation
@article{niu_vldb26,
title = {{STEM\^{}2: A Fast and Space-efficient Data Structure for Exact Multi-Set Membership Queries}},
author = {Niu, Yannian and Han, Song and Wang, Minmei},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {9},
pages = {2426--2438},
doi = {10.14778/3819518.3819561},
url = {https://doi.org/10.14778/3819518.3819561},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,844 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 9.5159229e-05 |
| 2,202 | Mega-KV: A Case for GPUs to Maximize the Throughput of In-Memory Key-Value Stores | 2015 | VLDB | 8.8719608e-05 |
| 3,703 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB | 7.0842566e-05 |
| 5,142 | The 3D Hash Join: Building On Non-Unique Join Attributes | 2022 | CIDR | 6.2571095e-05 |
| 6,936 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB | 5.6400144e-05 |
| 7,184 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD | 5.5913067e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,518 | Zeno Filter: To Infinity in Tiny Steps | 2026 | SIGMOD |
| 2 | 5,065 | Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage | 2024 | SIGMOD |
| 3 | 6,192 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB |
| 4 | 11,232 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 5 | 11,863 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD |
| 6 | 4,625 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |
| 7 | 6,957 | 2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection | 2017 | PODS |
| 8 | 11,737 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | SIGMOD |
| 9 | 6,936 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB |
| 10 | 7,184 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD |