2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
Summary: Proposes 2-3 cuckoo filters/tables: a two-out-of-three power-of-choices variant storing items in two of three buckets so any intersection item shares a location, enabling O(1) expected updates. Applies to set intersection and triangle listing with output-sensitive RAM time o(n)+O(k) and improved arboricity-aware I/O bounds. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,469 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7255912e-05 |
| 9,327 | Indexing for Keyword Search with Structured Constraints | 2023 | PODS | 4.351469e-05 |
| 9,861 | Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs | 2020 | VLDB | 4.2642656e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 2,219 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2653868e-05 |
| 4,783 | Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration | 2015 | PODS | 5.9215677e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,519 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD | 5.4682661e-05 |
| 2,465 | Fast Set Intersection in Memory | 2011 | VLDB | 8.7344475e-05 |
| 1,973 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.8834701e-05 |
| 5,043 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7350154e-05 |
| 2,469 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7255912e-05 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 8,499 | Conditional Cuckoo Filters | 2021 | SIGMOD | 4.4929219e-05 |
| 6,829 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB | 4.9083308e-05 |
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 2,219 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2653868e-05 |