Database Administrators Stack Exchange is a question and answer site for database professionals who wish to improve their database skills and learn from others in the community. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In DBMS, can someone please explain how the LRU (least recently used) buffer replacement policy acts when joining 2 relations in a database?

I have read that LRU is not efficient when joining two relations in a database compared to other buffer replacement policies. Is it true? Why?


migration rejected from Jul 25 '13 at 15:31

This question came from our site for professional and enthusiast programmers. Votes, comments, and answers are locked due to the question being closed here, but it may be eligible for editing and reopening on the site where it originated.

closed as unclear what you're asking by Paul White, dezso, Martin Smith, Mark Storey-Smith, RolandoMySQLDBA Jul 25 '13 at 15:31

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question.If this question can be reworded to fit the rules in the help center, please edit the question.

What's the source that these are related issues? – David Aldridge May 26 '13 at 8:37
See… for SQL Server. I assume that most RDBMS have similar technique (like CPU manufacturers) – gbn May 27 '13 at 8:31
Where have you read that LRU is inefficient when doing joins? Some context will help people answer your question. – James Lupolt Jul 25 '13 at 9:55