Timeline for How are entries in index leaf node ordered?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 17, 2020 at 13:00 | vote | accept | Nobuki Katori | ||
| Dec 17, 2020 at 12:57 | comment | added | J.D. | @NobukiKatori No problem! My answer encompasses that question. If the block is never split then you can either reorder at the time of insert which yes is a little bit of a performance hit or you can allow index fragmentation and not reorder on insert, only reorder when explicitly told to do so with an index rebuild / reorganize. This will be a heavier operation depending how fragmented the leaf level got at the point that it's ran, but is also not something done often. In practice, block splits occur to minimize the maintenance of reordering and fragmentation though, so this is negligible. | |
| Dec 17, 2020 at 12:52 | history | edited | J.D. | CC BY-SA 4.0 |
added 507 characters in body
|
| Dec 17, 2020 at 12:52 | comment | added | Nobuki Katori | Thanks for the answer. My question was more focused on, assuming that we don't need to split a block, if the entries within a block are ordered, if there are hundreds of entries, isn't it unperformant to reorder those? They are not using any type of double linked list, right? | |
| Dec 17, 2020 at 12:49 | history | answered | J.D. | CC BY-SA 4.0 |