DBScholar

Back to papers

A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets

Summary: Introduces a formal complexity model for batch-scheduling transactions with predeclared writesets, exposing a fundamental concurrency–computation tradeoff. Variants suggest batch schedulers can outperform conventional online scheduling at practical computational cost. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
7731
Venue
VLDB
Year
1982
Pagerank
-
Overall Rank
14,538 | 0.26%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{xu_vldb82,
        title = {{A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets}},
        author = {Xu, J.},
        journal = {PVLDB},
        series = {{VLDB} '82},
        pages = {77},
        year = {1982}
}

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

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers