Timeline for How are entries in index leaf node ordered?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2021 at 20:01 | answer | added | Richard Armstrong-Finnerty | timeline score: 1 | |
| Dec 17, 2020 at 13:26 | answer | added | Michael Green | timeline score: 0 | |
| Dec 17, 2020 at 13:00 | vote | accept | Nobuki Katori | ||
| Dec 17, 2020 at 12:49 | answer | added | J.D. | timeline score: 0 | |
| Dec 17, 2020 at 12:30 | comment | added | Nobuki Katori | Akina, what about when there is no need to split? | |
| Dec 17, 2020 at 10:31 | review | Close votes | |||
| Dec 17, 2020 at 21:52 | |||||
| Dec 17, 2020 at 10:23 | comment | added | Akina | within the block itself, if the order is maintained, how is that performant? Of course. Read about block split (divide the block to 2 blocks when its size reached during new row insertion) and compare the amount of work for this splitting when the rows are ordered and when they're mixed randomly. | |
| Dec 17, 2020 at 9:50 | review | First posts | |||
| Dec 17, 2020 at 10:13 | |||||
| Dec 17, 2020 at 9:48 | history | asked | Nobuki Katori | CC BY-SA 4.0 |