|
Why BTrees?
BTrees are one of programmings well kept secrets. Sure we all learn about Binary Trees in Computing 101. And then we really forget about trees as persistent storage. BTrees, and in particular the B+Trees implemented
by Virtual Machinery are very different from the Binary trees of your college days. They are the highly efficient data storage mechanisms underpinning todays most powerful commercial databases. These databases
interpose an SQL layer between you and the underlying BTree structure, Virtual Machinery's BTree implementation strips away this layer and gives you access
to the raw power underneath. Find out more about how you can use this power here.
|
|
How do BTrees work?
B+Trees are a structured data storage mechanism which divides the keys used to store the data and the data itself in files in the file system.
Since the keys are usuallly smaller than the data it is very quick to find the key. The Btree is organised so that the key points directly to
data and it can then be fetched very quickly. You can think of a BTree as being like a persistent hashmap. You can find out more about the theory
of B+Trees here.
|
Prices from $49.95.
Click here to buy Virtual Machinerys BTree implementation online.
|
|
Our BTree Product
Virtual Machinery offers a B+Tree implementation for the Java platform. The distribution comes with full documentation and example code. BTrees are useful
in the Java SE environment but also in the J2EE and J2ME environments. Our implementation also works out of the box in the Android environment.
Our implementation is a pure Java and as such is platform independant with a small footprint (less than 40k). Virtual Machinery has been producing BTree
implementations since 1990 and our code is used at the heart of Banking, Process Control, Telecommunications and Entertainment systems.
Find out more about our product by clicking here.
We offer a number of demonstration applications that use our B+Tree technology on each of these platforms- you can download these
by clicking here.
|
|
Performance
The B+Tree is one of the most performant disk-based data structures available. This is why it is at the heart of the main industrial-strength database
systems. At Virtual Machinery we believe we offer the best balance between performance and data integrity possible. With our 20 years experience in the business
we know what users require and we deliver it, offering sub-millisecond response on large datasets. This performance is available on any platform that supports
Java from hand held devices to mainframes. Find out more about Virtual Machinery's BTree performance by clicking here.
|
Try our product
Click here to download demos for Java SE, Java EE, Android and J2ME.
|
