Concurrent Set Manipulation Without Locking
Summary: Lock-free concurrent set algorithm supporting insert/delete/member using only single-location atomic read-modify-write operations, no locks and no aborts. Provides order-preserving serializability via weaker conditions than prior approaches, enabling higher concurrency with simpler primitives. (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. Vladimir Lanin (New York University)
- 2. Dennis Shasha (New York University)
BibTeX Citation
@inproceedings{lanin_pods88,
address = {New York, NY, USA},
series = {{PODS} '88},
title = {{CONCURRENT SET MANIPULATION WITHOUT LOCKING}},
url = {https://dl.acm.org/doi/10.1145/308386.308442},
doi = {10.1145/308386.308442},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lanin, Vladimir and Shasha, Dennis},
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 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 471 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.0001769727 |
| 1,316 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS | 0.00011050625 |
| 2,471 | Concurrency Control in B+-Trees Databases Using Preparatory Operations | 1985 | VLDB | 8.4135005e-05 |
| 2,575 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS | 8.2761608e-05 |
| 2,862 | Concurrency and Linear Hashing | 1985 | PODS | 7.9313182e-05 |
| 3,176 | Extendible Hashing for Concurrent Operations and Distributed Data | 1983 | PODS | 7.5669629e-05 |
| 4,904 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS | 6.3633656e-05 |
| 8,938 | Concurrent Operations in Extendible Hashing | 1986 | VLDB | 5.2559789e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,870 | An Almost-Serial Protocol for Transaction Execution in Main-Memory Database Systems | 2002 | VLDB |
| 2 | 14,788 | Maximal Concurrency By Locking | 1984 | PODS |
| 3 | 4,265 | An Abstract Model of Database Concurrency Control Algorithms | 1983 | SIGMOD |
| 4 | 2,856 | Hybrid Concurrency Control for Abstract Data Types (Extended Abstract) | 1988 | PODS |
| 5 | 2,781 | On-the-Fly, Incremental, Consistent Reading of Entire Databases | 1985 | VLDB |
| 6 | 5,821 | Locks with Constrained Sharing (Extended Abstract) | 1990 | PODS |
| 7 | 4,904 | Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms | 1984 | PODS |
| 8 | 1,316 | Concurrency Control In A Dynamic Search Structure | 1982 | PODS |
| 9 | 8,938 | Concurrent Operations in Extendible Hashing | 1986 | VLDB |
| 10 | 13,370 | Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking | 1992 | PODS |