On Affinity Based Routing in Multi-System Data Sharing
Summary: Affinity-based routing for multi-system data sharing cuts inter-system lock contention and buffer invalidation at high transaction rates. ILP-based classifier groups transactions by database call patterns; traces show reduced contention and latency, improving optimistic concurrency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,340 | Data Caching Tradeoffs in Client-Server DBMS Architectures | 1991 | SIGMOD | 8.8025447e-05 |
| 4,579 | Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems | 1993 | VLDB | 6.6916667e-05 |
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 |
|---|---|---|---|---|
| 1,634 | A Mean Value Performance Model for Locking in Databases: The Waiting Case | 1984 | PODS | 0.00010222257 |
Previous
Page 1 / 1
Next