DBScholar

Back to papers

Serialization Graph Algorithms for Multiversion Concurrency Control

Summary: MVSGA: multiversion serialization-graph framework that strictly subsumes prior schedulers by using read‑from/position edges and enforcing acyclicity to accept larger schedule sets. Optimality (maximize incomparable node pairs) NP‑complete; heuristic offered. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
822
Venue
PODS
Year
1988
Pagerank
8.2707581e-05
Overall Rank
2,675 | 81.65%
DOI
10.1145/308386.308426

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hadzilacos_pods88,
        address = {New York, NY, USA},
        series = {{PODS} '88},
        title = {{Serialization Graph Algorithms for Multiversion Concurrency Control}},
        url = {https://dl.acm.org/doi/10.1145/308386.308426},
        doi = {10.1145/308386.308426},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Hadzilacos, Thanasis},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers