Stable Set and Multiset Operations in Optimal Time and Space
Summary: Proves that all elementary binary set operations and their natural multiset generalizations on sorted files can be performed stably in asymptotically optimal time using only optimal extra space. Core contribution: a new space- and time-optimal stable algorithm for selecting matched records from a sorted file, used to implement the other operations. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
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 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,440 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS | 4.1945683e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1945683e-05 |
| 4,353 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 6.263585e-05 |
| 3,838 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD | 6.7134945e-05 |
| 13,812 | Relaxed Multi-Way Trees with Group Updates | 2001 | PODS | - |
| 5,682 | Optimal Indexing Using Near-Minimal Space [Extended Abstract] | 2003 | PODS | 5.372736e-05 |
| 1,746 | Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files | 1986 | SIGMOD | 0.00010696521 |
| 10,921 | Optimal (Multiway) Spatial Joins | 2024 | PODS | 4.1945683e-05 |
| 14,369 | Information Retrieval In Files Described Using Sets | 1975 | SIGMOD | - |
| 2,464 | Fast Set Intersection in Memory | 2011 | VLDB | 8.7524354e-05 |