Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract)
Summary: Introduces disjoint-interval topological sort (DITS), a unifying characterization of serializability: an input/output graph admits a DITS iff its schedule is serializable. Derives known criteria, polynomial WR+RW classes, multiversion extensions, and NP-completeness results. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. T. Ibaraki (Toyohashi University of Technology)
- 2. T. Kameda (Simon Fraser University)
- 3. T. Hinoura (Oregon State University)
BibTeX Citation
@article{ibaraki_vldb83,
title = {{Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract)}},
author = {Ibaraki, T. and Kameda, T. and Hinoura, T.},
journal = {PVLDB},
series = {{VLDB} '83},
year = {1983}
}
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 |
|---|---|---|---|---|
| 511 | On Concurrency Control by Multiple Versions | 1982 | PODS | 0.00017205623 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,209 | A semantic approach to correctness of concurrent transaction executions | 1985 | PODS |
| 2 | 3,384 | Towards a Unified Theory of Concurrency Control and Recovery | 1993 | PODS |
| 3 | 6,526 | Algorithmic Aspects of Multiversion Concurrency Control | 1985 | PODS |
| 4 | 2,675 | Serialization Graph Algorithms for Multiversion Concurrency Control | 1988 | PODS |
| 5 | 11,648 | Efficiently Supporting Adaptive Multi-Level Serializability Models in Distributed Database Systems | 2021 | SIGMOD |
| 6 | 2,450 | Formal Model of Correctness Without Serializability | 1988 | SIGMOD |
| 7 | 13,021 | Relative Serializability: An Approach for Relaxing the Atomicity of Transactions | 1994 | PODS |
| 8 | 12,877 | On Herbrand Semantics and Conflict Serializability of Read-Write Transactions (Extended Abstract) | 2000 | PODS |
| 9 | 14,468 | The Complexity of Reliable Concurrency Control | 1985 | PODS |
| 10 | 9,912 | THEORY OF SERIALIZABILITY FOR A PARALLEL MODEL OF TRANSACTIONS (Extended Abstract) | 1982 | PODS |