公开(公告)号：US09448966B2

公开(公告)日：2016-09-20

申请号：US13871276

申请日：2013-04-26

Applicant: FutureWei Technologies, Inc.

Inventor： Gangavara Prasad Varakur ,  Anil Chillarige

IPC: G06F15/173 ,  G06F15/80

CPC classification number: G06F15/80 ,  G06F11/0709 ,  G06F11/0751 ,  G06F11/1425 ,  G06F11/1482 ,  G06F11/2028 ,  G06F11/2035 ,  G06F15/17362

Abstract: System and method embodiments are provided to implement highly scalable and high availability (HA) clusters in massively parallel processing (MPP) systems. The embodiments include a method to build a highly scalable MPP HA cluster, which provides HA to the cluster while allowing it to scale to relatively larger number of nodes. An embodiment apparatus includes a plurality of data processing nodes distributed in a plurality of corresponding sub-clusters and configured to exchange heart-beat messages between each other within limit of each of the corresponding sub-clusters to maintain sub-cluster membership integrity and detect failures in the corresponding sub-clusters. The sub-clusters are arranged in a fan-out tree hierarchy and configured to prevent heart-beat messaging between each other.

Abstract translation: 提供系统和方法实施例以在大规模并行处理（MPP）系统中实现高可扩展性和高可用性（HA）群集。 这些实施例包括一种构建高度可扩展的MPP HA集群的方法，其向集群提供HA，同时允许其扩展到相对较大数量的节点。 实施例装置包括分布在多个对应子集群中的多个数据处理节点，并且被配置为在每个相应子集群的限制内彼此之间交换心跳消息，以维持子集群成员完整性并检测故障 在相应的子集群中。 子群集排列成扇形树层次结构，并配置为防止彼此之间的心跳信息。

公开(公告)号：US20160171072A1

公开(公告)日：2016-06-16

申请号：US14572502

申请日：2014-12-16

Applicant: Futurewei Technologies, Inc.

Inventor： Kamini Jagtiani ,  Gangavara Prasad Varakur

IPC: G06F17/30

CPC classification number: G06F16/2282 ,  G06F16/273

Abstract: In one embodiment, a method for adding partitions to a massively parallel processing (MPP) cluster includes determining whether a first number of available nodes of a first leaf sub-cluster (LSC) of a meta sub-cluster (MSC) of the MPP cluster is greater than or equal to a second number of partitions of a table and assigning a first node of the first LSC to a first partition when the first number of available nodes is greater than or equal to the second number of partitions. The method also includes searching for a second LSC in the MSC when the first number of available nodes is less than the second number of partitions.

Abstract translation: 在一个实施例中，用于向大规模并行处理（MPP）群集添加分区的方法包括确定MPP簇的元子群（MSC）的第一叶子群（LSC）的第一数目的可用节点 大于或等于表的第二数量的分区，并且当第一数量的可用节点大于或等于第二数量的分区时，将第一LSC的第一节点分配给第一分区。 该方法还包括当第一数量的可用节点小于第二数量的分区时，在MSC中搜索第二LSC。

公开(公告)号：US20140108633A1

公开(公告)日：2014-04-17

申请号：US13653308

申请日：2012-10-16

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Yuan Dai ,  Siew Tim-Tang ,  Kamini Jagtiani ,  Yang Sun ,  Gangavara Prasad Varakur ,  Bai Yang

IPC: G06F15/173

CPC classification number: G06F9/5061 ,  G06F17/30312 ,  G06F17/30445 ,  G06F17/30557 ,  G06F2209/505

Abstract: An embodiment method for massively parallel processing includes initiating a management instance on an initial machine, the management instance generating an initial partition corresponding to the initial machine, determining a total number of partitions desired for processing a database, the total number of partitions including the initial partition, determining a number of additional machines available to process the database, grouping the initial machine and the additional machines together in a pod, and launching the management instance on the additional machines in the pod to generate the total number of partitions desired for the database. Additional embodiment methods and an embodiment system operable to perform such methods are also disclosed.

Abstract translation: 用于大规模并行处理的实施例方法包括在初始机器上启动管理实例，所述管理实例生成对应于初始机器的初始分区，确定处理数据库所需的分区的总数，包括初始 分区，确定可用于处理数据库的多个附加机器，将起始机器和附加机器分组到一个pod中，并在该pod中的其他机器上启动管理实例以生成数据库所需的分区总数 。 还公开了另外的实施例方法和可操作以执行这些方法的实施例系统。

公开(公告)号：US09348641B2

公开(公告)日：2016-05-24

申请号：US13798344

申请日：2013-03-13

Applicant: FutureWei Technologies, Inc.

Inventor： Tejeswar Mupparti ,  Gangavara Prasad Varakur

IPC: G06F17/30 ,  G06F9/46

CPC classification number: G06F9/466 ,  G06F17/30174 ,  G06F17/30348 ,  G06F17/30377 ,  G06F17/30445 ,  G06F17/30545 ,  G06F17/30575

Abstract: A method for performing a transaction in a massively parallel processing (MPP) database includes receiving, by a transaction manager, from a first resource manager, a first snapshot of the first resource manager and receiving, by the transaction manager, from a second resource manager, a second snapshot of the second resource manager. Also, the method includes reconciling the first snapshot of the first resource manager and the second snapshot of the second resource manager to generate a reconciled snapshot and transmitting, by the transaction manager, to the first resource manager and the second resource manager, the reconciled snapshot. Additionally, the method includes performing a transaction using the reconciled snapshot.

Abstract translation: 用于在大规模并行处理（MPP）数据库中执行事务的方法包括由事务管理器从第一资源管理器接收第一资源管理器的第一快照并由事务管理器从第二资源管理器 ，第二个资源管理器的第二个快照。 此外，该方法包括协调第一资源管理器的第一快照和第二资源管理器的第二快照以生成对帐快照并由事务管理器向第一资源管理器和第二资源管理器发送已对准的快照 。 此外，该方法包括使用对帐快照执行事务。

公开(公告)号：US20150234841A1

公开(公告)日：2015-08-20

申请号：US14185516

申请日：2014-02-20

Applicant: FutureWei Technologies, Inc.

Inventor： Jacques Earl Hebert ,  Gangavara Prasad Varakur

IPC: G06F17/30

Abstract: Embodiments are provided herein for an efficient database storage model, which utilizes sparse file features to efficiently store and retrieve data. The embodiments provide database algorithms that utilize the file system abstraction layer to hide the complexity of managing disk space while providing the database a linear and contiguous logical address space for holding multiple database objects. An embodiment method includes pre-allocating, in a logical sparse file, a plurality of segments fixed in size and contiguous at fixed offsets. Upon receiving a command to write database objects to the segments, the database objects are mapped to the segments in a database catalog. The method further includes interfacing with a file system to initialize storage medium space for writing the data objects to the segments at the fixed offsets.

Abstract translation: 本文提供了用于有效的数据库存储模型的实施例，其利用稀疏文件特征来有效地存储和检索数据。 这些实施例提供利用文件系统抽象层隐藏管理磁盘空间的复杂性的数据库算法，同时为数据库提供用于保存多个数据库对象的线性和连续的逻辑地址空间。 一种实施方式包括在逻辑稀疏文件中预先分配固定大小并以固定偏移连续的多个段。 在接收到将数据库对象写入段的命令时，数据库对象将映射到数据库目录中的段。 该方法还包括与文件系统进行接口以初始化用于将固定偏移量的数据对象写入段的存储介质空间。

公开(公告)号：US20140279986A1

公开(公告)日：2014-09-18

申请号：US13798344

申请日：2013-03-13

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Tejeswar Mupparti ,  Gangavara Prasad Varakur

IPC: G06F9/46

CPC classification number: G06F9/466 ,  G06F17/30174 ,  G06F17/30348 ,  G06F17/30377 ,  G06F17/30445 ,  G06F17/30545 ,  G06F17/30575

Abstract: A method for performing a transaction in a massively parallel processing (MPP) database includes receiving, by a transaction manager, from a first resource manager, a first snapshot of the first resource manager and receiving, by the transaction manager, from a second resource manager, a second snapshot of the second resource manager. Also, the method includes reconciling the first snapshot of the first resource manager and the second snapshot of the second resource manager to generate a reconciled snapshot and transmitting, by the transaction manager, to the first resource manager and the second resource manager, the reconciled snapshot. Additionally, the method includes performing a transaction using the reconciled snapshot.

Abstract translation: 用于在大规模并行处理（MPP）数据库中执行事务的方法包括由事务管理器从第一资源管理器接收第一资源管理器的第一快照并由事务管理器从第二资源管理器 ，第二个资源管理器的第二个快照。 此外，该方法包括协调第一资源管理器的第一快照和第二资源管理器的第二快照以生成对帐快照并由事务管理器向第一资源管理器和第二资源管理器发送已对准的快照 。 此外，该方法包括使用对帐快照执行事务。

公开(公告)号：US20140122484A1

公开(公告)日：2014-05-01

申请号：US13663237

申请日：2012-10-29

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Kamini Jagtiani ,  Yang Sun ,  Siew Sim-Tang ,  Gangavara Prasad Varakur

IPC: G06F17/30

CPC classification number: G06F17/30339

Abstract: An embodiment method for massively parallel processing includes assigning a primary key to a first table in a database and a foreign key to a second table in the database, the foreign key of the second table identical to the primary key of the first table, determining a number of partition groups desired for the database, partitioning the first table into first partitions based on the primary key assigned and the number of partition groups desired, partitioning the second table into second partitions based on the foreign key assigned and the number of partition groups desired, and distributing the first partitions and the second partitions to the partition groups as partitioned. An embodiment system for implementing the embodiment methods is also disclosed.

Abstract translation: 用于大规模并行处理的实施例方法包括：将主密钥分配给数据库中的第一表，将外键分配给数据库中的第二表，第二表的外键与第一表的主键相匹配， 数据库所需的分区组数量，基于分配的主键和所分配的分组数将第一分区划分成第一分区，基于所分配的外键划分第二分区到第二分区，以及期望的分组数量 并且将第一分区和第二分区分配给分区的分区组。 还公开了用于实现实施方式的实施例系统。

公开(公告)号：US09239741B2

公开(公告)日：2016-01-19

申请号：US13653308

申请日：2012-10-16

Applicant: FutureWei Technologies, Inc.

Inventor： Yuan Dai ,  Siew Sim-Tang ,  Kamini Jagtiani ,  Yang Sun ,  Gangavara Prasad Varakur ,  Bai Yang

IPC: G06F9/50 ,  G06F17/30

CPC classification number: G06F9/5061 ,  G06F17/30312 ,  G06F17/30445 ,  G06F17/30557 ,  G06F2209/505

Abstract: An embodiment method for massively parallel processing includes initiating a management instance on an initial machine, the management instance generating an initial partition corresponding to the initial machine, determining a total number of partitions desired for processing a database, the total number of partitions including the initial partition, determining a number of additional machines available to process the database, grouping the initial machine and the additional machines together in a pod, and launching the management instance on the additional machines in the pod to generate the total number of partitions desired for the database. Additional embodiment methods and an embodiment system operable to perform such methods are also disclosed.

Abstract translation: 用于大规模并行处理的实施例方法包括在初始机器上启动管理实例，所述管理实例生成对应于初始机器的初始分区，确定处理数据库所需的分区的总数，包括初始 分区，确定可用于处理数据库的多个附加机器，将起始机器和附加机器分组到一个pod中，并在该pod中的其他机器上启动管理实例以生成数据库所需的分区总数 。 还公开了另外的实施例方法和可操作以执行这些方法的实施例系统。

公开(公告)号：US09195701B2

公开(公告)日：2015-11-24

申请号：US13663237

申请日：2012-10-29

Applicant: FutureWei Technologies, Inc.

Inventor： Kamini Jagtiani ,  Yang Sun ,  Siew Sim-Tang ,  Gangavara Prasad Varakur

IPC: G06F17/30

CPC classification number: G06F17/30339

Abstract: An embodiment method for massively parallel processing includes assigning a primary key to a first table in a database and a foreign key to a second table in the database, the foreign key of the second table identical to the primary key of the first table, determining a number of partition groups desired for the database, partitioning the first table into first partitions based on the primary key assigned and the number of partition groups desired, partitioning the second table into second partitions based on the foreign key assigned and the number of partition groups desired, and distributing the first partitions and the second partitions to the partition groups as partitioned. An embodiment system for implementing the embodiment methods is also disclosed.

Abstract translation: 用于大规模并行处理的实施例方法包括：将主密钥分配给数据库中的第一表，将外键分配给数据库中的第二表，第二表的外键与第一表的主键相匹配， 数据库所需的分区组数量，基于分配的主键和所分配的分组数将第一分区划分成第一分区，基于所分配的外键划分第二分区到第二分区，以及期望的分组数量 并且将第一分区和第二分区分配给分区的分区组。 还公开了用于实现实施方式的实施例系统。

公开(公告)号：US20140325182A1

公开(公告)日：2014-10-30

申请号：US13871276

申请日：2013-04-26

Applicant: FUTUREWEI TECHNOLOGIES, INC.

Inventor： Gangavara Prasad Varakur ,  Anil Chillarige

IPC: G06F15/80

CPC classification number: G06F15/80 ,  G06F11/0709 ,  G06F11/0751 ,  G06F11/1425 ,  G06F11/1482 ,  G06F11/2028 ,  G06F11/2035 ,  G06F15/17362

Abstract: System and method embodiments are provided to implement highly scalable and high availability (HA) clusters in massively parallel processing (MPP) systems. The embodiments include a method to build a highly scalable MPP HA cluster, which provides HA to the cluster while allowing it to scale to relatively larger number of nodes. An embodiment apparatus includes a plurality of data processing nodes distributed in a plurality of corresponding sub-clusters and configured to exchange heart-beat messages between each other within limit of each of the corresponding sub-clusters to maintain sub-cluster membership integrity and detect failures in the corresponding sub-clusters. The sub-clusters are arranged in a fan-out tree hierarchy and configured to prevent heart-beat messaging between each other.

Abstract translation: 提供系统和方法实施例以在大规模并行处理（MPP）系统中实现高可扩展性和高可用性（HA）群集。 这些实施例包括一种构建高度可扩展的MPP HA集群的方法，其向集群提供HA，同时允许其扩展到相对较大数量的节点。 实施例装置包括分布在多个对应子集群中的多个数据处理节点，并被配置为在每个相应子集群的限制内彼此之间交换心跳消息，以维持子集群成员完整性并检测故障 在相应的子集群中。 子群集排列成扇形树层次结构，并配置为防止彼此之间的心跳信息。