Features/Relational database

Usage

Since the 1960 it has been well known that SQL databases are the way to go for complex systems storage.

TS is based on the MySQL / MariaDB / Percona databases, and all data is fully normalized granting multiple benefits

• High performance with high volumes
• Easy to integrate with BI systems
• Predictable structures

Scalable applications

Applications built in TS will adhere to common design practices ensuring good performance, stability and integrity.

The platform is very scalable in regard to

• Complexity: You can keep extending the models as far as needed, using the Parent and Child relations. We even support logical constructs such as many-to-many relations.
• Performance: TS dataases are largely unaffected by data set sizes and number of concurrent users. There builtin configurations for indexing fields, and the built in searches can be supported by Elastic search and indexing

To prove our point we have actually had the whole platform running smoothly on a Rasperry PI.

Relational searches

A common problem querying data is specifying criterions and values in different parts of the model

 Show orders where the sum > 10000, and one or more ordelines refers to the product Smart TV

In TS this is handled gracefully by allowing interlinked searches

Look at parents refering children

1. Make a search in the child items (optionally name the view)
   • Set search criterions normally
2. Make another search in parent item
   • Set search criterions normally
   • In the List of children field refer to the CURRENT_QUERY (or given name)

Look at children refering parents

1. Make a search in the parent items (optionally name the view)
2. Make another search in child items
   • In the Parent reference field refer to the CURRENT_QUERY (or given name)