tags:

views:

52

answers:

2
+1  Q: 

Maximum number of descendants in a B-tree

If you know the order of a B-tree, how do you figure out the maximum number of descendants from a page?

+1  A: 

It depends on the current depth below that page, then it's just arithmetic.

EJP  2010-04-03 01:34:06
I'm still not getting it. Can you or someone else elaborate with an example?
Phenom  2010-04-03 02:15:35
If you have one set of pages below the current page, the maximum number of descendants from that page is N squared, because there can be up to N descendants and each can contain up to N items. If you have another level below that ... work it out for yourself ...
EJP  2010-04-06 08:46:35
+2  A: 

The maximum number of descendants is just the number of points in the node, since each pointer points to a descendant.

Phenom  2010-04-06 18:11:42

related questions

Are keys in B-tree nodes duplicated when the node is split?
Do btrees and b+trees only store data at the leafs?
What is a B-tree page
Do DB indexes take same amount of disc space as column data?
how B-tree indexing works in mysql
Best data structure for crossword puzzle search
Does anybody know how B-Tree got its name?
How are B Tree nodes typically represented?
C/C++: How to store data in a file in B tree
Advantages of BTree+ over BTree
Using code from a book without plagiarizing
size of B+ tree
Does anyone know where I might find a file based multi-way B-Tree Class for c#?
Looking for a disk-based B+ tree implementation in C++ or C
good ADT to implement BTREE
javascript binary search tree implementation
Which datastructure is appropriate for this situation?
Is there an API to draw a B-TREE?
saving Btrees to a disk file and read it
What's the difference between B-Tree and GiST index methods (in PostgreSQL)?
Larger than memory data structures and how they are typically handled
Techniques for Caching SQL Query Data
Binary Search or Btree index Update problem
What is a good open source B-tree implementation in C?