DBScholar

Back to papers

Concurrency on High-Traffic Data Elements

Summary: Tackles hot-spot contention on heavily accessed numeric aggregate fields by permitting concurrent arithmetic updates and reads to avoid 2PL-induced serialization. Generalizes the IMS Fast Path idea to broader numeric types and proves that, under algebraic conditions (commutativity/invertibility), such concurrent executions are equivalent to some serial schedule. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
613
Venue
PODS
Year
1982
Pagerank
6.6202221e-05
Overall Rank
4,580 | 68.58%
DOI
10.1145/588111.588126

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{reuter_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Concurrency on High-Traffic Data Elements}},
        url = {https://dl.acm.org/doi/10.1145/588111.588126},
        doi = {10.1145/588111.588126},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Reuter, Andreas},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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