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
- 1. Bing-Chao Huang (Washington State University)
- 2. Michael A. Langston (Washington State University)
BibTeX Citation
@inproceedings{huang_pods88,
address = {New York, NY, USA},
series = {{PODS} '88},
title = {{Stable Set and Multiset Operations in Optimal Time and Space}},
url = {https://dl.acm.org/doi/10.1145/308386.308458},
doi = {10.1145/308386.308458},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Huang, Bing-Chao and Langston, Michael A.},
year = {1988}
}
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 |
|---|---|---|---|---|
| 1 | 11,638 | Frequent Elements with Witnesses in Data Streams | 2021 | PODS |
| 2 | 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 3 | 3,724 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD |
| 4 | 3,533 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD |
| 5 | 14,013 | Relaxed Multi-Way Trees with Group Updates | 2001 | PODS |
| 6 | 6,753 | Optimal Indexing Using Near-Minimal Space [Extended Abstract] | 2003 | PODS |
| 7 | 2,721 | Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files | 1986 | SIGMOD |
| 8 | 11,141 | Optimal (Multiway) Spatial Joins | 2024 | PODS |
| 9 | 14,570 | Information Retrieval In Files Described Using Sets | 1975 | SIGMOD |
| 10 | 2,245 | Fast Set Intersection in Memory | 2011 | VLDB |