Method and server for searching for data stream dividing point based on server
AssigneeHuawei Technologies Co., Ltd.
InventorsChuanshuai Yu, Chengwei Zhang, Linbo Xu
Life of this patent
Estimating the term…
Abstract
Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.
Claims15
A method performed by a server processor for determining for a data stream dividing point and for dividing data into a plurality of portions, the method comprising:
- receiving a data stream on a transmission path;
- determining the data stream dividing point of the data stream by performing the steps of:
- determining a window Wx[k−Ax, k+Bx] and a preset condition Cx corresponding to the window Wx[k−Ax, k+Bx] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M≥2, and Ax and Bx are integers for establishing a potential dividing point k,
- determining whether at least a part of data in the indow Wz[k−Az, k+Bz] meets a preset condition Cz,and z indicates a integer from 1 to M;
- and
- when the at least a part of data in the window Wz[k−Az, k+Bz] does not meet the preset condition Cz, skipping N minimum units U for searching for a data stream dividing point from the current potential dividing point k along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥Bz∥+maxx(∥Ax∥), so as to obtain a new potential dividing point;
- when at least a part of data in each window Wx[k−Ax, k+Bx] of M windows of the current potential dividing point k meets the preset condition Cx, dividing the data stream at the current potential dividing point k;
- and
- storing the divided data.
A server for determining a data stream dividing point for dividing data into a plurality of portions, comprising:
- one or more processors and a communications interface, the communications interface coupled to the one or more processors;
- and
- the one or more processors configured to:
- receive a data stream;
- determine a window Wx[k−Ax,k+Bx] and a preset condition Cx corresponding to the window Wx[k−Ax,k+Bx] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M≥2, and Ax and Bx are integers for establishing a potential dividing point k of the data stream,
- determine whether at least a part of data in the window Wz[k−Az,k+Bz] meets a preset condition Cz, and z indicates a integer from 1 to M;
- and
- when the at least a part of data in the window Wz[k−Az,k+Bz] does not meet the preset condition Cz, skip N minimum units U for searching for a data stream dividing point from the current potential dividing point k along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥Bz∥+maxx(∥Ax∥), so as to obtain a new potential dividing point;
- and
- when at least a part of data in each window Wx[k−Ax,k+Bx] of M windows of the current potential dividing point k meets the preset condition Cx, divide the data stream at the current potential dividing point k.
A non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium is configured to store executable computer instructions for execution by a processor that prompts the processor to determine a potential dividing point k for dividing data into a plurality of portions for a received data stream by:
- determining a window Wx[k−Ax, k+Bx] and a preset condition Cx corresponding to the window Wx[k−Ax,k+Bx] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M≥2, and Ax and Bx are integers for establishing a potential dividing point k,
- determining whether at least a part of data in the window Wz[k−Az,k+Bz] meets a preset condition Cz, and z indicates a integer from 1 to M;
- and
- when the at least a part of data in the window Wz[k−Az,k+Bz] does not meet the preset condition Cz, skipping N minimum units U for searching for a data stream dividing point from the current potential dividing point k along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥Bz∥+maxx(∥Ax∥), so as to obtain a new potential dividing point;
- and
- when at least a part of data in each window Wx[k−Ax, k+Bx] of M windows of the current potential dividing point k meets the preset condition Cx, dividing the data stream at the current potential dividing point k.
Dependencies are inferred from the claim text.