Questions tagged [b-plus-tree]

A B+ tree is an n-ary tree with a variable but often large number of children per node, suitable for storing data for efficient retrieval in a block-oriented storage context. B+ trees are often used in file systems and databases.

A B+ tree is an n-ary tree with a variable but often large number of children per node, suitable for storing data for efficient retrieval in a block-oriented storage context. B+ trees are often used in file systems and databases.

https://en.wikipedia.org/wiki/B+_tree

27 questions
0
votes
1 answer

How to convert a btree to a b+tree

I have a fully working B-Tree, and I want to convert this into a B+tree. Is there any way that I can achieve that without changing so much of my code? is it possible?
David
  • 165
  • 12
0
votes
0 answers

Java B+tree implementation

I am trying to make a B+tree implementation in java and I tried to use help from the internet. There are no help almost about this subject, but I was able to find this piece of Code in C++ and I am trying to convert it to java. My question is this a…
David
  • 165
  • 12
0
votes
0 answers

Rapid speed degradation with protobuf-net when 'ProtoMember' is modified

I'm using two great libraries BPlusTree and Protobuf-net to store/retrieve a large number of items to/from disk. I'm allowed to modify any of the serialized items ... everything works perfect till this point. At first modification the speed drops to…
Dr. Strangelove
  • 2,725
  • 3
  • 34
  • 61
0
votes
0 answers

CSharpTest.Net.BPlusTree Cross-Process locking

I am using CSharpTest.Net.BPlusTree library for data storage. How can I read from the same tree from different processes?
Victor Mukherjee
  • 10,487
  • 16
  • 54
  • 97
0
votes
0 answers

Adding search key value into a B+ tree

I have this question on one of my practice paper and i was wondering how do i go about doing it. Any help is welcome. Consider the following B+-tree, where a node can contain two search key values and three pointers. Redraw the B+-tree after…
user2691544
  • 359
  • 1
  • 4
  • 11
0
votes
1 answer

What is a B* tree and how does it differ from a B tree and a B+ tree?

I can't seem to find a solid answer of what B* tree is. I am aware that a B tree stores both keys and data in its internal and leaf nodes and B+ tree stores keys in its interior nodes and data in its leaf nodes but how is B* tree different?
0
votes
0 answers

B tree implementation to B+ tree

im trying to create a B+ tree from a previous B tree implementation I create, but Im really lost here... the only difference from B to B+ im trying to implement, is storing the keys on the leaves instead of removing them. Example: Final B Tree 3 6…
Lilith Deficiency
  • 157
  • 1
  • 6
  • 17
0
votes
1 answer

Fully Persistent B+ Tree

I'm trying to implement B+ tree (in C language) with each key being some data(int/float/string) and corresponding value is a list, whose size is not fixed. I want to store this tree in a file and access later on, when required. You may consider the…
Chaithanya
  • 608
  • 1
  • 8
  • 29
-1
votes
1 answer

OutOfMemoryError when trying to add elements from a B+Tree to an ArrayList

I'm attempting to traverse through a B+ Tree and add the elements from the leaves into an ArrayList with the following code: public void toArrayList(Node node){ Node currentNode = node; if(currentNode instanceof InnerNode){ …
K091916
  • 9
  • 2
-1
votes
1 answer

Optimized B+ tree implementation

I am working on a high-performance single-thread java application. My project depends on a B+ tree. Because performance is very critical, I prefer not to implement it myself and use an optimized public implementation. This way I am more assured that…
Bat
  • 771
  • 11
  • 29
-1
votes
1 answer

How many B/B+ tree will be created if I add a multi column index?

In mysql with InnoDB storage engine, When create a multi column index, such as (a, b, c), how many B+ tree/B tree will be create? Explain the detail if you can.
FisherMartyn
  • 826
  • 1
  • 8
  • 17
-2
votes
1 answer

Defining an object inside a function in a B+ tree

I am trying to implement a B+ tree. This is a very small portion of the actual code. I had some problems when passing an object pointer to a function. As far as I know, those objects created inside the function are destroyed afterwards. So what…
Pure
  • 85
  • 1
  • 8
1
2