Wikipedia:Reference desk/Archives/Computing/2018 February 24

= February 24 =

B-Tree bulkloading
Can anybody provide some good sources for B-Tree construction by bulkloading?

The article contains some description, but it seems incomplete, not general enough, actually non-algorithmic, and - last but not least - absolutely unsourced. Please see B-tree for the doubtful part and Talk:B-tree for my doubts. --CiaPan (talk) 22:04, 24 February 2018 (UTC)
 * Bulkloading is well documented, but as a feature of B+ trees: specifically. Subjective I have a vague reminiscence the "+" might have been used reflecting that occurrence, ie, their design is better suited for it. It seems what we can easily find on the subject ( bulk loading, but B-trees ) is either one "Yes, it can be done, here is how I would", or  "We .. are doing it the following way: ". like. The point is that flat there is a huge lot of allocation to keep trace of compared with using B+ trees. This means if it's not so difficult to initiate a tree bulk loading it ( as in the article, ) it's another matter adding data to it, and keeping similar ambitions. Sources which are available easily, see please . --Askedonty (talk) 20:16, 1 March 2018 (UTC)