Features/Relational database - Revision history

Kpe: /* Complexity */

2024-11-10T08:46:28Z

Complexity

← Older revision		Revision as of 10:46, 10 November 2024
Line 14:		Line 14:
	You can keep extending the models as far as needed, using the Parent and Child relations.		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. TS has customers running more than 350 linked applications on the same server.		Due to a very elaborate and flexible permission model, multiple user types and scanarios can easily be supported on the same setup.

			We even support logical constructs such as many-to-many relations. TS has customers running more than 350 linked applications on the same server.

	=== Performance ===		=== Performance ===

Kpe: /* Performance */

2024-11-10T08:44:41Z

Performance

← Older revision		Revision as of 10:44, 10 November 2024
Line 22:		Line 22:

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


	=== Volumes ===		=== Volumes ===

Kpe: /* Scalable applications */

2024-11-10T08:44:31Z

Scalable applications

← Older revision		Revision as of 10:44, 10 November 2024
Line 11:		Line 11:

	The platform is very scalable in regard to		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. TS has customers running more than 350 linked applications on the same server.		=== Complexity ===
	* '''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.		You can keep extending the models as far as needed, using the Parent and Child relations.
	* '''Volumes~~:'''~~ Databases will handle large amounts gracefully, but large object sizes will often cause problems in back/restore scenarios. TS supports unlimited file size and count, using a mixed database and block storage approach.
			We even support logical constructs such as many-to-many relations. TS has customers running more than 350 linked applications on the same server.

			=== 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.


			=== Volumes ===
			Databases will handle large amounts gracefully, but large object sizes will often cause problems in back/restore scenarios.

			TS supports unlimited file size and count, using a mixed database and block storage approach.

	== Relational searches ==		== Relational searches ==

Kpe: /* Scalable applications */

2024-11-10T08:43:22Z

Scalable applications

← Older revision		Revision as of 10:43, 10 November 2024
Line 11:		Line 11:

	The platform is very scalable in regard to		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.		* '''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. TS has customers running more than 350 linked applications on the same server.
	* '''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		* '''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.
			* '''Volumes:''' Databases will handle large amounts gracefully, but large object sizes will often cause problems in back/restore scenarios. TS supports unlimited file size and count, using a mixed database and block storage approach.
	To prove our point we have actually had the whole platform running smoothly on a Rasperry PI.

	== Relational searches ==		== Relational searches ==

Kpe: /* Look at children refering parents */

2024-11-10T08:37:52Z

Look at children refering parents

← Older revision		Revision as of 10:37, 10 November 2024
Line 32:		Line 32:
	=== Look at children refering parents ===		=== Look at children refering parents ===
	# Make a search in the parent items (optionally name the view)		# Make a search in the parent items (optionally name the view)
	# Make another search in child items		#* Set search criterions normally
			# Make another search in child items
			#* Set search criterions normally
	#* In the ''Parent reference'' field refer to the CURRENT_QUERY (or given name)		#* In the ''Parent reference'' field refer to the CURRENT_QUERY (or given name)

Kpe: /* Look at parents refering children */

2024-11-10T08:37:31Z

Look at parents refering children

← Older revision		Revision as of 10:37, 10 November 2024
Line 25:		Line 25:
	=== Look at parents refering children ===		=== Look at parents refering children ===
	# Make a search in the child items (optionally name the view)		# Make a search in the child items (optionally name the view)
			#* Set search criterions normally
	# Make another search in parent item		# Make another search in parent item
			#* Set search criterions normally
	#* In the ''List of children'' field refer to the CURRENT_QUERY (or given name)		#* In the ''List of children'' field refer to the CURRENT_QUERY (or given name)

Kpe: /* Relational searches */

2024-11-10T08:35:30Z

Relational searches

← Older revision		Revision as of 10:35, 10 November 2024
Line 19:		Line 19:
	A common problem querying data is specifying criterions and values in different parts of the model		A common problem querying data is specifying criterions and values in different parts of the model

	Show orders where the sum > 10000 and one ~~of the~~ ordelines refers to Smart TV		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		In TS this is handled gracefully by allowing interlinked searches

Kpe: /* Relational searches */

2024-11-10T08:34:55Z

Relational searches

← Older revision		Revision as of 10:34, 10 November 2024
Line 17:		Line 17:

	== Relational searches ==		== 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 of the ordelines refers to Smart TV

			In TS this is handled gracefully by allowing interlinked searches

			=== Look at parents refering children ===
			# Make a search in the child items (optionally name the view)
			# Make another search in parent item
			#* In the ''List of children'' field refer to the CURRENT_QUERY (or given name)

			=== Look at children refering parents ===
			# Make a search in the parent items (optionally name the view)
			# Make another search in child items
			#* In the ''Parent reference'' field refer to the CURRENT_QUERY (or given name)

Kpe: Created page with "== 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..."

2024-11-10T08:19:35Z

Created page with "== 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..."

New page

== 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 ==