Database Paper Browser

Back to papers

Priority-Hints: An Algorithm for Priority-Based Buffer Management

Summary: Proposes Priority-Hints, a buffer management algorithm that uses hints from DBMS access methods to support multi-priority workloads. Across diverse workloads, it outperforms simple LRU and matches or exceeds more complex, information-heavy schemes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7985
Venue
VLDB
Year
1990
Pagerank
9.695642e-05
Overall Rank
2,043 | 85.79%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 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.

Rank Cited Paper Year Venue Pagerank
75 Disk Shadowing 1988 VLDB 0.00057303824
128 An Evaluation of Buffer Management Strategies for Relational Database Systems 1985 VLDB 0.00044535268
937 Scheduling Real-time Transactions: a Performance Evaluation 1988 VLDB 0.00015207578
2,343 Scheduling Real-Time Transactions with Disk Resident Data 1989 VLDB 9.0012398e-05
2,858 Priority in DBMS Resource Scheduling 1989 VLDB 8.0008765e-05
3,972 On Being Optimistic about Real-Time Constraints 1990 PODS 6.5771215e-05
Previous Page 1 / 1 Next

Semantically Similar Papers