Method and server for searching for data stream dividing point based on server

• US 10,542,062 B2
• Filed: 03/13/2019
• Issued: 01/21/2020
• Est. Priority Date: 02/14/2014
• Status: Active Grant

• Current Assignee: Xfusion Digital Technologies Company Limited
• Original Assignee: Huawei Technologies Co., Ltd. (Huawei Investment & Holding Co., Ltd.)
• Inventors: Yu, Chuanshuai, Zhang, Chengwei, Xu, Linbo
• Primary Examiner(s): Tiv, Backhean
• Application Number:
  US16/352,509
• Publication Number:
  US 20190215352A1
• Time in Patent Office: 314 Days
• Field of Search: None
• CPC Class Codes: G06F 16/2255 Hash tables
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0641 De-duplication techniques
• CPC Class Codes: G06F 3/0673 Single storage device
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 65/762 at the source reformatting of additional data in video distribution servers H04N21/2355

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.

Claims

1. 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 W_x[k−

A_x, k+B_x] and a preset condition C_x corresponding to the window W_x[k−

A_x, k+B_x] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M≥

2, and A_x and B_x are integers for establishing a potential dividing point k,

determining whether at least a part of data in the indow W_z[k−

A_z, k+B_z] meets a preset condition C_z,and z indicates a integer from 1 to M; and

when the at least a part of data in the window W_z[k−

A_z, k+B_z] does not meet the preset condition C_z, 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 ∥

B_z∥

+max_x(∥

A_x∥

), so as to obtain a new potential dividing point;

when at least a part of data in each window W_x[k−

A_x, k+B_x] of M windows of the current potential dividing point k meets the preset condition C_x, dividing the data stream at the current potential dividing point k; and

storing the divided data.

2. The method according to claim 1, wherein windows W_e[k−

A_e,k+B_e] and W_f[k−

A_f,k+B_f] meet conditions |A_e+B_e|=|A_f+B_f| and C_e=C_f, e and f indicates integers from 1 to M.

3. The method according to claim 2, wherein A_e−

1=A_f and B_e+1=B_f.

4. The method according to claim 1, wherein determining, by using a random function, whether the at least a part of data in the window W_z[k−

A_z,k+B_z] meets the preset condition C_z.

5. The method according to claim 4, wherein the determining, by using a random function, whether the at least a part of data in W_z[k−

A_z,k+B_z] meets the preset condition C_z is specifically;

determining, by using a hash function, whether the at least a part of data in W_z[k−

A_z, k+B_z] meets the preset condition C_z.

6. 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 W_x[k−

A_x,k+B_x] and a preset condition C_x corresponding to the window W_x[k−

A_x,k+B_x] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M≥

2, and A_x and B_x are integers for establishing a potential dividing point k of the data stream,

determine whether at least a part of data in the window W_z[k−

A_z,k+B_z] meets a preset condition C_z, and z indicates a integer from 1 to M; and

when the at least a part of data in the window W_z[k−

A_z,k+B_z] does not meet the preset condition C_z, 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 ∥

B_z∥

+max_x(∥

A_x∥

), so as to obtain a new potential dividing point; and

when at least a part of data in each window W_x[k−

A_x,k+B_x] of M windows of the current potential dividing point k meets the preset condition C_x, divide the data stream at the current potential dividing point k.

7. The server according to claim 6, wherein windows W_e[k−

A_e,k+B_e] and W_f[k−

A_f, k+B_f] meet conditions |A_e+B_e|=|A_f+B_f| and C_e=C_f,e and f indicates integers from 1 to M.

8. The server according to claim 7, wherein A_e−

1=A_f and B_e+1=B_f.

9. The server according to claim 6, wherein the processor is specifically configured to determine, by using a random function, whether the at least a part of data in the window W_z[k−

A_z,k+B_z] meets the preset condition C_z.

10. The server according to claim 9, wherein the processor is specifically configured to determine, by using a hash function, whether the at least a part of data in the window W_z[k−

A_z,k+B_z] meets the preset condition C_z.

11. 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 W_x[k−

A_x, k+B_x] and a preset condition C_x corresponding to the window W_x[k−

A_x,k+B_x] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M≥

2, and A_x and B_x are integers for establishing a potential dividing point k,

determining whether at least a part of data in the window W_z[k−

A_z,k+B_z] meets a preset condition C_z, and z indicates a integer from 1 to M; and

when the at least a part of data in the window W_z[k−

A_z,k+B_z] does not meet the preset condition C_z, 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 ∥

B_z∥

+max_x(∥

A_x∥

), so as to obtain a new potential dividing point; and

when at least a part of data in each window W_x[k−

A_x, k+B_x] of M windows of the current potential dividing point k meets the preset condition C_x, dividing the data stream at the current potential dividing point k.

12. The non-transitory computer-readable storage medium according to claim 11, wherein windows W_e[k−

A_e,k+B_e] and W_f[k−

A_f,k+B_f] meet conditions |A_e+B_e|=|A_f+B_f| and C_e=C_f, e and f indicates integers from 1 to M.

13. The non-transitory computer-readable storage medium according to claim 12, wherein A_e−

1=A_f and B_e+1=B_f.

14. The non-transitory computer-readable storage medium according to claim 11, wherein determining, by using a random function, whether the at least a part of data in the window W_z[k−

A_z, k+B_z] meets the preset condition C_z.

15. The non-transitory computer-readable storage medium according to claim 14, wherein determining, by using a hash function, whether the at least a part of data in the window W_z[k−

A_z,k+B_z] meets the preset condition C_z.