|
myownstars: Thanks for the two links. The first link talks about modified LRU lists and how new blocks are inserted and old blocks age out. But there's no mention of searching the lists. Is it a simple linear search? Or it uses some more sophisticated data structure?
The second link talks about adaptive hash index, which is an index automatically built (and dropped?) *on an existing index* of a table. If the table does not have any index, there will never be an adaptive hash index. Do I understand that correctly? I think in this discussion here, we should focus on finding the data structures and algorthms that are used to locate data blocks in buffer pool, not on MySQL's indexes. Right? |
|