Database Paper Browser

Back to papers

On Herbrand Semantics and Conflict Serializability of Read-Write Transactions (Extended Abstract)

Summary: Introduces Herbrand semantics for read-write transactions, deriving commutativity-based conflicts that yield distinct serializability classes and unify update-in-place and deferred-update correctness. Shows prefix-closed variants boost parallelism, rules out undesirable schedules admitted by prior criteria, and defines a stronger serializability capturing intuitively correct schedules yet incomparable to prefix-reducibility and optimistic criteria. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1208
Venue
PODS
Year
2000
Pagerank
4.1945683e-05
Overall Rank
12,684 | 11.76%
DOI
-

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 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,710 Towards a Unified Theory of Concurrency Control and Recovery 1993 PODS 8.2504476e-05
Previous Page 1 / 1 Next

Semantically Similar Papers