Abstract: A computing system is provided for modeling a deployment of heterogeneous memory on a server network. The computing system receives a user input of parameters including a memory ratio of local memory to heterogeneous memory in each server, a first relative throughput when an entire dataset is in local memory on a server, and a second relative throughput when the entire dataset is in heterogeneous memory on the server. Based on these parameters, the system determines a server ratio of a number of servers in an enhanced cluster with heterogeneous memory to a number of servers in a baseline cluster without heterogeneous memory, where the enhanced cluster and the baseline cluster deliver equivalent data throughput performance. Based on the parameters and the server ratio, a server network design is generated and outputted.

Abstract: Disclosed is an approach for improved access of databases using a space-filling curve, such as a z-order curve, and a sparse tree. The space-filling curve traverses every point in n-dimensional space of a multidimensional data structure. The sparse tree can be implemented as a cache to store which rows of the multidimensional data structure have actual data. The sparse tree may have one or more nodes merged into a single node, The sparse tree may have one or more node limits at each node that limit node spawning. Node counters track how many rows containing data not mapped correspond to each node. As the multidimensional data structure is searched, the search path is adjusted by reseeking back to rows that are located in the sparse tree. Further, the search path is adjusted by reseeking back to rows that are located within a query box.

Abstract: Disclosed is an approach for improved access of databases using a space-filling curve, such as a z-order curve, and a sparse tree. The space-filling curve traverses every point in n-dimensional space of a multidimensional data structure. The sparse tree can be implemented as a cache to store which rows of the multidimensional data structure have actual data. The sparse tree may have one or more nodes merged into a single node, The sparse tree may have one or more node limits at each node that limit node spawning. Node counters track how many rows containing data not mapped correspond to each node. As the multidimensional data structure is searched, the search path is adjusted by reseeking back to rows that are located in the sparse tree. Further, the search path is adjusted by reseeking back to rows that are located within a query box.