Talk:(a,b)-tree
Add topic | This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Help, how should I contribute here?
[edit]I want to contribute to this article, but I’m not confident I would get the style right. (Very new here.)
First of all, I’d like to revise the introduction to (a,b)-trees. The point is that an (a,b)-tree is a multi-way search tree (more general than a binary search tree, where the keys in a node divide up the universe into ranges, so a search path travels between keys to the right node), with bounds on how many keys are allowed per internal node.
So when we define operations FIND, INSERT, and DELETE, we have to include the step of splitting or joining the nodes of the tree, to meet the (a,b) requirement.
Secondly, I think this could use a section on the amortized time complexity of these operations. This is covered in Martin Mareš' lecture notes on Data Structures: http://mj.ucw.cz/vyuka/dsnotes/03-abtree.pdf If I add this section, should I also include a proof, or should I just cite that source and give the amortized complexity as a fact?
Lastly, I see that there's also an article about B-trees, which are a special case of (a,b)-trees. Should this article be merged with that one?
I don't think this subject is notable enough to have its own article. I found some definitions in some academic presentations, but nothing more. I think that it would be much better organizationally to merge this page with B-tree, which I have done. Please let me know if you have any questions. HyperAccelerated (talk) 21:12, 22 November 2024 (UTC)