Build TREE primary key by sorting
Registered by
Kostja Osipov
The server currently inserts every row from a snapshot into the primary index, one by one. This is many times slower compared to the case when all rows are inserted without sorted, and later on sorted with quicksort.
Build the primary key of TREE type by sorting, by first reading all rows from the snapshot, and then sorting the result.
Blueprint information
- Status:
- Complete
- Approver:
- Kostja Osipov
- Priority:
- Undefined
- Drafter:
- Kostja Osipov
- Direction:
- Approved
- Assignee:
- Aleksey Demakov
- Definition:
- Approved
- Series goal:
- Accepted for 1.4
- Implementation:
-
Implemented
- Milestone target:
-
1.4.8
- Started by
- Kostja Osipov
- Completed by
- Kostja Osipov
Related branches
Related bugs
Sprints
Whiteboard
(?)
