DBScholar

Back to papers

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)

Paper ID
7774
Venue
VLDB
Year
1983
Pagerank
5.093636e-05
Overall Rank
13,252 | 9.08%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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