Dynamic Data Redistribution

As mentioned earlier, legacy databases were architected to minimize data movement and exchange. This legacy remains in today's market solutions and manifests as a significant performance penalty when data is exchanged between nodes in a parallel system. This penalty has imposed implementation constraints: data models that are query aware, and data placement that is sympathetic to queries. As noted, this has serious consequences: large amount of time, effort and money is expended in developing and supporting point solutions. These point solutions are unable to support newer types of analyses and ad-hoc queries.

XtremeData's dbX software implements an innovative and highly efficient system for the dynamic redistribution of data as necessary, over industry standard network technology. Data exchanges between nodes occur as peer-to-peer transient transfers at runtime for query needs. The data exchanges are carefully pipelined with processing stages, such that the transfer times on the network are effectively hidden and do not significantly affect query execution time. dbX ensures that all joins perform at near the speeds of co-located joins. Dynamic data redistribution eliminates the need for query aware data models and sympathetic placement of data, thus significantly reducing implementation time, labor and costs.

XtremeData allows users to simply "load and go" with any data model and any placement. No longer does a team of DBAs need to fully understand the usage patterns and try to match the placement with queries to obtain performance. XtremeData provides high performance out of the box, at all scales.