virtual memory 4483

possibly you are thinking of simulation of LRU for things like database caches ... rather than processor paging that has hardware support for reference and change bits ... and paging least recently used replacement stragies that approximate LRU with approaches like clock. ref:

in that situation, where the database cache entries have little or no correspondance to any familiar hardware support for change-reference bits ... then you might find a link-list of database cache entries. the database manager can emulate least recently used of database cache entries by updating a cache line link list whenever a transaction requests a location of a database record (and it is found in the cache) and the cache location is returned (i.e. remove the found cache line from its current location in the linked list and move it to the front of the list).

for some topic drift ... misc. posts mentioning working on original relational-sql implementation

and in the previous incarnation of this subject

it strayed into doing cross-cache transfers in conjunction with the work on distributed lock manager for ha-cmp

and a little more drift here

misc. other past posts mentioning distribute lock manager work

--