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
-2
votes
3 answers

changing two values at a time in java

How can I change two values concurrently. I am writing a code for b-tree in java. But i am unable to modify two variables at a time. Like in C , we do so by using pointers. But how to do so in java? I hope my question is understandable.
provokoe
  • 178
  • 2
  • 10
-2
votes
1 answer

why i cant install btree module in python

PS C:\Users\MY PC> pip install btree Collecting btree Using cached btree-0.2.1.tar.gz (40 kB) Installing build dependencies ... done Getting requirements to build wheel ... error error: subprocess-exited-with-error × Getting…
Shrivara S Samaga
  • 1
-2
votes
2 answers

Why random operations on a B tree is not good?

I went through below article and trying to understand different data structures for data persistence . In the article it is written that sequential operations are good for B-tree but not random operations . Article link Will you please put some…
Priyaranjan Swain
  • 361
  • 4
  • 17
-2
votes
1 answer

How is mongodb implemented and why is it different than sql databases

I was wondering how is mongodb (nosql in general) implemented? Is it using B+ trees? If so, how and why is it different to SQL databases? Thank you!
stilllearning
  • 1
  • 1
  • 3
-2
votes
1 answer

Recurrence Relation for the following code?

What is the recurrence relation of the above algorithm? a step-by-step walkthrough would be appreciated.
panther1
  • 115
  • 9
-2
votes
1 answer

B-Tree losing data on insert

I am trying to implement a b-tree. When inserting the 6th element, I lose everything except the newly created 2 nodes resulting in splitting a leaf and the middle value of them. Here is my code: #include #include struct node { …
Rdlgrmpf
  • 9
  • 2
-2
votes
1 answer

B+-Tree in Java

I want to create a simple implementation of a B+-Tree in Java and i need some help. I want my program to implement these functions: search, insert, delete. My questions: What is the best data structure to use to represent the Tree? I was thinking…
Christos Baziotis
  • 5,845
  • 16
  • 59
  • 80
-3
votes
1 answer

Reversed recursive traversal B-Tree

I have a B-Tree with a traverse function I found on GeeksForGeeks that does standard inorder traversal. I tried to modify it to do reversed inorder traversal by changing the for loop but it does not seem to work. Any ideas? private void…
Luka Jozić
  • 162
  • 2
  • 12
-3
votes
1 answer

Level order traversal of a B-tree

I am writing a symulator of a B-tree. I read here stackoverflow that the best way is use a queue to make a level order traversal. But i have no idea how to do it. I work on implementation in c++ from geeksforgeeks. Perhaps someone knows how to…
Jonatan23
  • 33
  • 1
  • 4
-3
votes
2 answers

expected unqualified-id before ‘->’ token

I'm trying to make a b-tree from an array, and I've came up with this code, but it's not compiling, and is giving me this error: "expected unqualified-id before ‘->’ token" at line 42: node->balance = right_height - left_height; Here is the full…
Gustavo Moreira
  • 13
  • 1
  • 2
-3
votes
1 answer

PostgreSQL B+ tree implementation

Where can i get the PostgreSQL B+ tree implementation?
Pantheo
  • 129
  • 1
  • 8
  • 15
-4
votes
2 answers

Not sure where the segmentation fault is

I'm getting problem with segmentation fault when trying to compile a C++ program, but not sure where the problem lies. I suspect that the problem lies with the .find() ..... could it be the iterator operator < and == which are the comparators for…
iteong
  • 715
  • 3
  • 10
  • 26
1 2 3
…
50
51