Guest blog post by Yuanjen Chen
As we've seen how in-place and in-memory work differently, today we are sharing more fundamentals of in-place computing model. This models was designed to solve "Big and Complex Data," - not just about size but more about the complexity. We see many analytic cases today incorporate multiple relations of data, for instance, when we try to solve a data mining case for an online retailer, we may need to analyze both product attributes (categories, colors, materials..) and customer attributes (age, gender, region, ...) and even more. Such an in-depth analysis greatly counts on the relational model which can be dealt by a relational database, the data size we encounter today, however, might be too heavy for the traditional database technology. A NoSQL database scales, nonetheless, does not fit the relational model.
The In-place Computing Model aims to fill in the gap between these two systems; it supports extended relational model while maintaining the performance as well as the scalability. This computing is unconventional in two ways; first, it moves away from data retrieval to a data-centric model in the sense that computations take place where data resides. Second, it determines the data objects in macro data structure that works in the way how macro molecules do in living cells. These two principles altogether help to organize the big data complexity and contribute to the substantial performance improvement: 2 to 3 orders of magnitude compared to the existing in-memory databases.