Today we continue discussing the best practice from storage engineering:
565) The focus on business value does not remain confined to the people on the border with the customers. It comes from deep within product development and engineering.
566) The storage product can relieve compute altogether where results are computed once and saved for all subsequent usages. This works well for data that does not change over time.
567) When the data changes frequently, it helps to organize it in a way such that those that don’t change are on one side and those that do are on the other side. This helps to making incremental results from the data.
568) Data will inevitably have patterns with reuse. We can call them sequences. While most data might be stored with general purpose btree, the sequences call for more efficient data structures such as radix tree. These help insert and lookup sequences easier.
569) Sequences are more efficiently stored if they are sorted. This canonicalizes them. It also makes lookup use binary search.
570) The number of sequences might become very large. In such case, it might be better to not make it part of the same tree and user other data structures like better to navigate shards
565) The focus on business value does not remain confined to the people on the border with the customers. It comes from deep within product development and engineering.
566) The storage product can relieve compute altogether where results are computed once and saved for all subsequent usages. This works well for data that does not change over time.
567) When the data changes frequently, it helps to organize it in a way such that those that don’t change are on one side and those that do are on the other side. This helps to making incremental results from the data.
568) Data will inevitably have patterns with reuse. We can call them sequences. While most data might be stored with general purpose btree, the sequences call for more efficient data structures such as radix tree. These help insert and lookup sequences easier.
569) Sequences are more efficiently stored if they are sorted. This canonicalizes them. It also makes lookup use binary search.
570) The number of sequences might become very large. In such case, it might be better to not make it part of the same tree and user other data structures like better to navigate shards
No comments:
Post a Comment