Research on possibility of RDBMS to have performance benchmarks like no-sql Databases (part 2)

There are clear evidences now that major RDBMS (row and column ) will be out performed by specialized engines and RDBMS will be left with business data processing(OLTP) and hybrid markets . but new OLTP systems are also booming who claims to beat RDBMS in OLTP as well . Most of RDBMS are 25 year old legacy code which follows “one size fits all ” should be retire and a complete new thoughts has to be put for next generation of RDBMS.

Specilized DB

In previous post we looked into some transaction and processing  bottlenecks in RDBMS .(

Today we will look into single-sited transactions .

in many OLTP workloads every table except a single one called the root, has exactly one join term which is a n-1 relationship to its ancestor. Hence, the schema is a tree of 1-n relationships. We denote this class of schemas as tree schemas. Such schemas are popular; for example, customers produce orders, which have line items and fulfillment schedules.Tree schemas have an obvious horizontal partitioning over the nodes in a grid. Specifically, the root table can be range or hash partitioned on the primary key(s). Every descendant table can be partitioned such that all equi-joins in the tree span only a single site.

In a tree schema, suppose every command in every transaction class has equality predicates on the primary key(s) of the root node (for example, in an e-commerce application, many commands will be rooted with a specific customer, so will include predicates like customer_id = 27). Using the horizontal partitioning discussed above, it is clear that in this case every SQL command in every transaction is local to one site. If, in addition, every command in each transaction class is limited to the same  single site . This valuable feature that every transaction can be run to completion at a single site is backbone of transaction managers in RDBMS .

The single sited transaction will remain in any futuristic RDBMS but to include distributed processing and memory grids there has to be some changes which will address in some other day.