The STSdb W4.0 engine is based on WaterfallTree™ data structure – a patented STS Soft SC technology. W-tree effectively solves one of the most fundamental problems in the database world - speed degradation on random keys indexing.
This allows STSdb W4.0 to support multiple indexes in real-time over multiple tables without performance impact. The database works blazing with both random & sequential keys.
Read more
Get started with the easy to use, simple and intuitive database interface. Explore the features and possibilities of STSdb W4.0 described in a simple and interactive way. It’s a step-by-step process that provides the necessary information to get the database running in no time.
Read moreAn unique blend
between data indexing and
streaming large data.
The bottleneck of
every database is the seek time latency
of a storage device.
Compares the
new W-tree technology with
existing technologies.
Innovative data structure for
real-time indexing of low and high
level entropy keys.
Scalable and versatile node for
cloud computing, big enterprise and
heterogeneous systems.
Get familiar with
the simple and intuitive
database API.
STSdb is an embedded NoSQL database and virtual file system in one. It is build up from scratch without using any third party components. Data is stored in a very flexible key-value format where the key consists of the combination of sub-keys (represented as comparable types) and an associated value (represented as a collection of serializable types).
In STSdb data is multi-dimensionally indexed (lexicographically ordered) by key. This characteristic allows it to support existing data models and different indexing strategies.
The backbone of STSdb is WaterfallTree™ - patent pending technology of STS Soft SC. Formally W-tree is a natural generalization of B+-tree. In general operations in B+-tree are executed synchronously (one by one) while in W-tree operations are executed аsynchronously (in groups). As a result W-tree solves the problem of speed degradation when indexing records with random keys. This allows to maintain multiple indexes in real-time without harming system performance. Theoretical models and empirical studies show 100x increase in speed of indexing using W-tree instead of B+-tree.
