Abstract: The present application relates to a method for statistical distribution characterization of dendritic structures in original position of single crystal superalloy, and relates to the technical field of analysis of metal material composition and microstructure, comprising the following steps: step 1, processing a to-be-tested sample and determining a calibration coefficient; step 2, obtaining a two-dimensional element content distribution map of the to-be-tested sample; and step 3, determining the number and average spacing of primary dendrites. A composition distribution region analyzed in the present application is larger than the area of a distribution region of the traditional microscopic analysis method, and the sample preparation is simple. The distribution, number and average spacing of the primary dendrites can be obtained without metallographic corrosion sampling.

Abstract: A method for data redistribution of a job data in a first datanode (DN) to at least one additional DN in a Massively Parallel Processing (MPP) Database (DB) is provided. The method includes recording a snapshot of the job data, creating a first data portion in the first DN and a redistribution data portion in the first DN, collecting changes to a job data copy stored in a temporary table, and initiating transfer of the redistribution data portion to the at least one additional DN.

Abstract: System and method embodiments are provided for using different storage formats for a primary database and its replicas in a database managed replication (DMR) system. As such, the advantages of both formats can be combined with suitable design complexity and implementation. In an embodiment, data is arranged in a sequence of rows and stored in a first storage format at the primary database. The data arranged in the sequence of rows is also stored in a second storage format at the replica database. The sequence of rows is determined according to the first storage format or the second storage format. The first storage format is a row store (RS) and the second storage format is a column store (CS), or vice versa. In an embodiment, the sequence of rows is determined to improve compression efficiency at the CS.

Abstract: The present disclosure discloses Lactobacillus sakei ZFM225, with a preservation number of CCTCC NO:M 2016669. The present disclosure further discloses an isolation and purification method of an Lactobacillus sakei ZFM225 bacteriocin, including the steps of: precipitating fermentation supernatant of the Lactobacillus sakei ZFM225 by an ammonium sulfate precipitation method to obtain crude protein; desalting the crude protein to obtain crude protein extract; isolating the crude protein extract by cation exchange chromatography, performing elution with a gradient eluent containing 0.5 M to 1.0 M NaCl, and desalting the obtained eluate to obtain a preliminary protein purified solution; and then purifying the preliminary protein purified solution by reversed-phase high-performance liquid chromatography to obtain the Lactobacillus sakei ZFM225 bacteriocin. The Lactobacillus sakei ZFM225 bacteriocin has antibacterial activity on both gram-positive bacteria and gram-negative bacteria.

Abstract: The present disclosure discloses a method for isolating and purifying Lactobacillus rhamnosus ZFM216 bacteriocin, the method including the following steps: preparing L. rhamnosus ZFM216 fermentation supernatant; treating the fermentation supernatant with macroporous adsorption resin method to obtain a crude protein extract; isolating the crude protein extract by gel chromatography to obtain a preliminary purified protein solution; and then performing purification by reversed-phase high performance liquid chromatography (HPLC) to obtain an L. rhamnosus ZFM216 bacteriocin solution. The present disclosure further provides use of the L. rhamnosus bacteriocin in anti-Staphylococcus aureus.

Abstract: The present invention discloses a method for purifying indole-3-lactic acid from a Lactobacillus plantarum fermentation supernatant, using a fermentation supernatant of Lactobacillus plantarum ZJ316 with a deposit number CCTCC NO: M 208077, including the following steps: adsorbing the fermentation supernatant with a macroporous resin XAD-16 first, then performing elution, collecting an eluate corresponding to 50% methanol with a pH of 7, and concentrating the eluate to obtain a concentrate; performing separation on the concentrate through dextrangel G25 to obtain a G25-2 fraction; and purifying the G25-2 fraction by reversed-phase high performance liquid chromatography, and concentrating the collected eluate to obtain the indole-3-lactic acid. The indole-3-lactic acid obtained in the present invention has a purity of 99.00%, and has broad-spectrum antibacterial activity.

Abstract: A method for processing query fault, where a database server receives a query statement and generates a corresponding query plan tree including multiple layers of operators in a pipeline relationship, and each layer includes operation symbols having logical relationship with each other. The server executes the query statement according to the query plan tree, extracts intermediate status information of a faulty operator when a fault occurs in a process of executing the query statement, updates operation symbols of the faulty operator and a logical relationship among the operation symbols according to the query plan tree and the intermediate status information to obtain a reconstructed query plan tree, and continues to execute the query statement according to the reconstructed query plan tree after the fault is recovered.

Abstract: A method for data redistribution of a job data in a first datanode (DN) to at least one additional DN in a Massively Parallel Processing (MPP) Database (DB) is provided. The method includes recording a snapshot of the job data, creating a first data portion in the first DN and a redistribution data portion in the first DN, collecting changes to a job data copy stored in a temporary table, and initiating transfer of the redistribution data portion to the at least one additional DN.

Abstract: The present application relates to a method for statistical distribution characterization of dendritic structures in original position of single crystal superalloy, and relates to the technical field of analysis of metal material composition and microstructure, comprising the following steps: step 1, processing a to-be-tested sample and determining a calibration coefficient; step 2, obtaining a two-dimensional element content distribution map of the to-be-tested sample; and step 3, determining the number and average spacing of primary dendrites. A composition distribution region analyzed in the present application is larger than the area of a distribution region of the traditional microscopic analysis method, and the sample preparation is simple. The distribution, number and average spacing of the primary dendrites can be obtained without metallographic corrosion sampling.

Abstract: System and method embodiments are provided for using different storage formats for a primary database and its replicas in a database managed replication (DMR) system. As such, the advantages of both formats can be combined with suitable design complexity and implementation. In an embodiment, data is arranged in a sequence of rows and stored in a first storage format at the primary database. The data arranged in the sequence of rows is also stored in a second storage format at the replica database. The sequence of rows is determined according to the first storage format or the second storage format. The first storage format is a row store (RS) and the second storage format is a column store (CS), or vice versa. In an embodiment, the sequence of rows is determined to improve compression efficiency at the CS.

Abstract: A method for data redistribution of a job data in a first datanode (DN) to at least one additional DN in a Massively Parallel Processing (MPP) Database (DB) is provided. The method includes recording a snapshot of the job data, creating a first data portion in the first DN and a redistribution data portion in the first DN, collecting changes to a job data copy stored in a temporary table, and initiating transfer of the redistribution data portion to the at least one additional DN.

Abstract: A computer-implemented method of relocating data in a distributed database comprises: creating, by one or more processors, a second table in the distributed database, the second table including all columns from a first table; copying, by the one or more processors, a first set of tuples from the first table to the second table; modifying, by the one or more processors, during the copying of the first set of tuples, data of the first table according to a modification; after the copying of the first set of tuples, modifying, by the one or more processors, data of the second table according to the modification; and switching, by the one or more processors, the second table for the first table in a catalog of the distributed database.

Abstract: A computer-implemented method and system at a network switch provides using one or more processors to perform a pre-defined database function on query data contained in data messages received at the network switch, with the performing producing result data, and wherein the pre-defined database function is performed on the query data in a first mode of operation to a state of full completion, generating complete result data and no skipped query data, and in a second mode of operation to a state of partial completion, generating partially complete result data and skipped query data. Further, the method and system performing one or more network switch functions to route the complete result data, and/or route the partially complete result data and skipped query data, to one or more destination nodes. In addition, an application programming interface (API) is used to define the database function.

Abstract: A method for processing query fault, where a database server receives a query statement and generates a corresponding query plan tree including multiple layers of operators in a pipeline relationship, and each layer includes operation symbols having logical relationship with each other. The server executes the query statement according to the query plan tree, extracts intermediate status information of a faulty operator when a fault occurs in a process of executing the query statement, updates operation symbols of the faulty operator and a logical relationship among the operation symbols according to the query plan tree and the intermediate status information to obtain a reconstructed query plan tree, and continues to execute the query statement according to the reconstructed query plan tree after the fault is recovered.

Abstract: A method for processing query fault, where a database server receives a query statement and generates a corresponding query plan tree including multiple layers of operators in a pipeline relationship, and each layer includes operation symbols having logical relationship with each other. The server executes the query statement according to the query plan tree, extracts intermediate status information of a faulty operator when a fault occurs in a process of executing the query statement, updates operation symbols of the faulty operator and a logical relationship among the operation symbols according to the query plan tree and the intermediate status information to obtain a reconstructed query plan tree, and continues to execute the query statement according to the reconstructed query plan tree after the fault is recovered.

Abstract: A method to produce data of a series of location coordinates of a motor vehicle includes one or more of the following: receiving a location point on a map of the motor vehicle, each location being treated as a child with a specific character; grouping multiple children who reside in a common area, the grouping sharing a same parent; and identifying the parent as a common zone factor, wherein the common zone factor is a constant value common to all location points of a particular zone.

Abstract: Architecture that includes an index creation algorithm that utilizes available resources and dynamically adjusts to successfully scale with increased resources and be able to do so for any data distribution. The resources can be processing resources, memory, and/or input/output, for example. A finer level of granularity, called a segment, is utilized to process tuples in a partition while creating an index. The segment also aligns with compression techniques for the index. By choosing an appropriate size for a segment and using load balancing the overall time for index creation can be reduced. Each segment can then be processed by a single thread thereby limiting segment skew. Skew is further limited by breaking down the work done by a thread into parallelizable stages.

Abstract: This disclosure provides a clustering storage method and apparatus. The method includes: storing to-be-stored first data row by row into a local memory in a database system; determining a first sorting column, where the first sorting column is used to sort data that has been cached in the local memory; sorting second data according to the first sorting column if the second data that has been cached in the local memory meets a preset condition, where the second data is data, which has been cached into the local memory, in the first data; and storing the sorted second data in a clustering manner into a storage medium in the database system.

Abstract: A computer-implemented method and system are provided, including executing an application programming interface (API) in a network switch to define at least one of one or more database functions, performing, using one or more processors, the one or more database functions on at least a portion of data contained in a data message received at the switch, to generate result data, and routing the result data to one or more destination nodes. A database function-defined network switch includes a network switch and one or more processors to perform a pre-defined database function on query data contained in data messages received at the switch, to produce result data, wherein the pre-defined database function is performed on the query data in a first mode of operation to a state of full completion, generating complete result data and no skipped query data, or to a state of partial completion, generating partially completed result data and skipped query data.