Skew-resilient query processing for fast networks

T Ziegler, C Binnig, U Röhm - 2019 - dl.gi.de
2019dl.gi.de
Motivation: Scalable distributed in-memory databases are at the core of data-intensive
computation. Although scaling-out solutions help to handle large amounts of data, more
nodes do not necessarily lead to improved query performance. In fact, recent papers have
shown that performance can even degrade when scaling out due to higher communication
overhead (eg, shuffling data across nodes) and limited bandwidth [Rö15]. Thus, current
distributed database systems are built with the assumption that the network is the major …
Motivation: Scalable distributed in-memory databases are at the core of data-intensive computation. Although scaling-out solutions help to handle large amounts of data, more nodes do not necessarily lead to improved query performance. In fact, recent papers have shown that performance can even degrade when scaling out due to higher communication overhead (eg, shuffling data across nodes) and limited bandwidth [Rö15]. Thus, current distributed database systems are built with the assumption that the network is the major bottleneck [BH13] and should be avoided at all costs.
In recent years, high-speed networks (eg, InfiniBand (IB)) with a bandwidth close to the local memory bus [Bi16] have become economically viable. These network technologies provide Remote Direct Memory Access (RDMA) to allow direct memory access to a remote host and also reduce the latency of data transfer through bypassing the remote’s CPU [In17, Gr10]. Therefore, the assumption that the network is the bottleneck no longer holds.
dl.gi.de
以上显示的是最相近的搜索结果。 查看全部搜索结果