Talk:B+ tree
From Wikipedia, the free encyclopedia
inner insert break the B+ tree definition
b+ tree is a tree with leaves if it has height n than its order is n . it has keys .
Why all that code?! Is this the way a Wikipedia article should be written? Please consider fleshing out the article to add more "information" and less "code". --221.134.26.57 17:43, 21 May 2006 (UTC)
- The code really needs to be pared down to the minimum amount to demonstrate the ADT. I'm in favor of rewriting the C++ and dropping the java. The third party libraries and debug code should definately go for an encyclopedic article. I'll try and get the code written this weekend.
- A brisson 08:48, 7 June 2006 (UTC)
-
- Why have sample code here at all? -- Mikeblas 14:37, 7 June 2006 (UTC)
- I propose moving the code to another Wiki-project (like WikiSource), or at least to a separate page on Wikipedia, and then have a link to that page in this article. As it stands now, it's pretty confusing (IMHO).
- --User:aadnk 19:48, 2 June 2006 (UTC)
- I agree that the source should be in a different article. I put it here because I didnĀ“t find any better place. As for de violation of the B+ invariants during insertion, that is a known feature of the code to make it easier to understand. If you can make the code canonical and keep it simple at the same time, please be my guest. Simplicity is the reason I did not implement key deletion. It is usually implemented in a non-canonical way (deleting a node only when it is completely empty) because it is both easier to implement and its usually at least as efficient as the canonical one. (David Garcia -- unlogged)
- Agreed. Alot of the code is also incorrect (maybe its formatted wrong) - there are lots of underscores missing. I think too much code. Pseudo code would do just fine. --Smremde 08:49, 13 June 2006 (UTC)
A picture would be nice.
[edit] How is the subject pronounced?
Lipatden 14:45, 11 July 2006 (UTC)
- "bee plus tree". If someone knows IPA, it would be great if they could add a pronunciation guide to the article. -- Mikeblas 15:40, 11 July 2006 (UTC)