Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract)
Summary: Introduces disjoint-interval topological sort (DITS) as a serializability concept for I/O graphs. DITS is necessary and sufficient for serializability; extends to multi-version, with WR+RW as the largest recognizable class and NP-completeness results. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. T. Ibaraki
- 2. T. Kameda
- 3. T. Minoura
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 |
|---|---|---|---|---|
| 332 | On Concurrency Control by Multiple Versions | 1982 | PODS | 0.00027208023 |
Previous
Page 1 / 1
Next