Stack Overflow
Stack Overflow

Questions tagged [b-tree]

B-trees are a type of self balancing search tree where each node can hold multiple keys and all leaf nodes are the same distance from the root.

B-trees are an extension of self-balancing binary search trees to allow each node to hold multiple keys and have multiple children. They are designed to take advantage of systems that can read and write in large blocks, and are commonly used in databases and file systems.

B-trees on Wikipedia

762 questions
-1
votes
1 answer

Elements out of order in b-tree implementation

I'm having a problem with a B-tree (not a binary tree). It works for some values, but when I tried with (1,2,3,4,5,6), I get this output: Level 0: 2 4 Level 1: 1 3 6 5 when the correct output is Level 0: 2 4 Level 1: 1 3 5 6 I need help, I can't…
Guilherme Magno
  • 13
  • 2
-1
votes
3 answers

SQL Connection string for Retail Pro Application Database

I am trying to make a program using c# in .net for some custom data report. I need to do this based on a Retail Pro 8 POS Application and look forward for suggestions / help in understanding how to get the database connection. A hint given to me was…
Gagan Bhatia
  • 41
  • 6
-1
votes
1 answer

B Tree and B+Tree Index diferencies

I'm studying B+ Tree and B Tree and I would like to understand two things about it, if someone can clarify it to me I would appreciate it: Why can I store more search keys on an B+ Tree Index? My guess would be that the reason is because the nodes…
David
  • 1
-1
votes
1 answer

Btree with pointers

typedef struct T{ //Main struct of the nodes char *value; //String view like a pointer struct T *T_l, *T_r; //Pointers left and right …
Jilz
  • 31
  • 5
-1
votes
1 answer

B-Tree K-D-B Tree and R-Tree improve search

How can B-Tree K-D-B Tree and R-Tree help improve efficiency and accuracy of the search.
Nuttanon Pornpipak
  • 19
  • 3
-1
votes
1 answer

B-Trees insertion

How do I add 35? How do I know whether to move a key up(up to the node with 34 and 78, and if I do that, which key do I move up) and make more children(to fulfill the "A non-leaf node with k children contains k−1 keys." rule) OR just split up the…
ABCD123
  • 137
  • 1
  • 6
-1
votes
1 answer

Is there is any limit for order in B-tree and B+tree?

In a B tree and B+tree , If we specify the order as 5 then we can store the 4 keys in a single node and 5 pointers for that node. It has any limit for setting the order in the above trees (or) its limit is infinite ?
Bhuvanesh
  • 1,269
  • 1
  • 15
  • 25
-1
votes
1 answer

b-tree fullness (as percentage)

I am currently busy implementing a B-Tree in JAVA. One of the methods requires me return as a percentage the fullness of the complete tree. The percentage should be out of 100 and if, for example, 50 is returned, it means that the tree is 50% full.…
Gtamcn
  • 23
  • 4
-1
votes
1 answer

Inserting nodes with equal keys in a B-tree

I am trying to insert 3 4s into an empty B-tree. t = 3. I tried some applets online but all thay do is insert 4 once and then just drop 4. Is it the way it has been implemented in CLRS as I did not completely understand their pseudocode.
user3386395
  • 1
  • 1
-1
votes
1 answer

How to write OOBtree indexing on disk?

I have large information to index and create posting List for retrieval later, I searched and understood that BTree Data structure is suitable to store large data mapping on disk. In The python Libraries I found Btree 4.08 and read the Document, I…
Nastaran Hakimi
  • 695
  • 1
  • 16
  • 36
-1
votes
1 answer

postgresql query optimization with btree on multiple columns

I have a large table with a btree index on multiple keys. If a make a query by fixing the first two columns of the index and putting a unilateral bound on the third column, it results in a very very slow query even if the number of matching rows is…
Emanuele Paolini
  • 9,912
  • 3
  • 38
  • 64
-1
votes
3 answers

good ADT to implement BTREE

What data structure should I use to implement a BTree? Why?
cplusplusNewbie
  • 613
  • 1
  • 10
  • 18
-1
votes
1 answer

Issue with C++ B-tree

I am using the Google's C++ B-tree and I have an issue that someone might be able to answer. First of all I get the following error: In file included from ref_impl/../include/btree_map.h:31:0, from…
glarkou
  • 7,023
  • 12
  • 68
  • 118
-1
votes
1 answer

Sorted Array to 2-4+ Tree in Linear Time

I need help with the following question: Describe an algorithm that given a sorted array of size n builds a 2-4+ tree that contains the same keys as the array. The algorithm should run in time O(n). I already know how to build a red black tree from…
Robert777
  • 801
  • 3
  • 12
  • 24
-1
votes
1 answer

B-Tree, difficulties to understand

I need to find out what would be the keys contained in the final level of data-bearing nodes if I insert value in increasing order in it. My BTree is of order 3, and I would like to know how to plot it, if insert values from 0 to 15. Thanks in…
eouti
  • 5,338
  • 3
  • 34
  • 42
1 2 3
…
50
51