Database Paper Browser

Back to papers

Non-Deterministic Queue Operations

Summary: Introduces a transaction model that permits non-deterministic queue semantics to enable high-concurrency extended queue operations (non-blocking dequeue/enqueue, priority dequeue). Achieves large concurrency gains by relaxing strict ordering and using novel conflict-resolution semantics to preserve transactional correctness. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
924
Venue
PODS
Year
1991
Pagerank
4.7910746e-05
Overall Rank
7,244 | 49.61%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,272 Tolerating Bounded Inconsistency for Increasing Concurrency in Database Systems 1992 PODS 4.7811016e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
45 Sagas 1987 SIGMOD 0.00071800944
862 Implementing Recoverable Requests Using Queues 1990 SIGMOD 0.00015845857
1,075 Organizing Long-Running Activities with Triggers and Transactions 1990 SIGMOD 0.00014250476
2,315 Hybrid Concurrency Control for Abstract Data Types (Extended Abstract) 1988 PODS 9.0443059e-05
Previous Page 1 / 1 Next

Semantically Similar Papers