会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 83. 发明公开
    • COMMUNICATION FOR EFFICIENT RE-PARTITIONING OF DATA
    • 沟通有效地重新分配数据
    • EP3198494A1
    • 2017-08-02
    • EP16738233.2
    • 2016-05-12
    • Oracle International Corporation
    • IDICULA, SamBASANT, AartiAGGARWAL, VikasWOLF, StephanAGARWAL, Nipun
    • G06F17/30H04L12/40
    • H04L67/10G06F16/2471G06F16/278H04L12/40143H04L47/828
    • A method, apparatus, and system for efficiently re-partitioning data using scheduled network communication are provided. Given re-partitioning data defining the data blocks to be sent amongst a plurality of server nodes, a corresponding network schedule is determined to send the data blocks in a coordinated manner. The network schedule is divided into time slots, wherein each of the plurality of server nodes can send up to one data block and receive up to one data block in each time slot. By using a greedy selection algorithm that prioritizes by largest senders and largest receivers, a near optimal schedule can be determined even in the presence of heavy skew. The greedy selection algorithm can be implemented with a O(T*N^2) time complexity, enabling scaling to large multi-node clusters with many server nodes. The network schedule is of particular interest for database execution plans requiring re-partitioning on operators with different keys.
    • 提供了一种使用调度的网络通信有效地重新划分数据的方法,设备和系统。 考虑到在多个服务器节点中重新划分定义要发送的数据块的数据,相应的网络调度被确定为以协调的方式发送数据块。 网络调度被分成时隙,其中多个服务器节点中的每一个可以发送多达一个数据块并且在每个时隙中接收多达一个数据块。 通过使用优先发送者和最大接收者的贪婪选择算法,即使存在严重的歪斜,也可以确定接近最佳的时间表。 贪婪选择算法可以用O(T * N2)时间复杂度实现,从而可以扩展到具有许多服务器节点的大型多节点群集。 网络时间表对于需要使用不同密钥对运营商进行重新分区的数据库执行计划特别重要。