Method and server for searching for data stream dividing point based on server
First Claim
1. A method performed by a server processor executing computer instructions stored in a server memory for searching for a data stream dividing point for dividing data into a plurality of portions to facilitate data storage according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M windows Wx[k−
Ax, k+Bx] and a preset condition Cx corresponding to the window Wx[k−
Ax, k+Bx], 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, the method comprising;
(a) determining a corresponding window Wiz[ki−
Az, ki+Bz] for a current potential dividing point ki according to the rule, wherein i and z are integers, and 1≦
z≦
M;
(b) determining whether at least a part of data in the window Wiz[ki−
Az, ki+Bz] meets a preset condition Cz; and
when the at least a part of data in the window Wiz[ki−
Az, ki+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 ki 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 performing step (a); and
(c) when at least a part of data in each window Wix[ki−
Ax, ki+Bx] of M windows of the current potential dividing point ki meets the preset condition Cx, selecting the current potential dividing point ki as a data stream dividing point.
2 Assignments
0 Petitions
Accused Products
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.
-
Citations
24 Claims
-
1. A method performed by a server processor executing computer instructions stored in a server memory for searching for a data stream dividing point for dividing data into a plurality of portions to facilitate data storage according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M windows Wx[k−
Ax, k+Bx] and a preset condition Cx corresponding to the window Wx[k−
Ax, k+Bx], 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, the method comprising;(a) determining a corresponding window Wiz[ki−
Az, ki+Bz] for a current potential dividing point ki according to the rule, wherein i and z are integers, and 1≦
z≦
M;(b) determining whether at least a part of data in the window Wiz[ki−
Az, ki+Bz] meets a preset condition Cz; andwhen the at least a part of data in the window Wiz[ki−
Az, ki+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 ki 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 performing step (a); and(c) when at least a part of data in each window Wix[ki−
Ax, ki+Bx] of M windows of the current potential dividing point ki meets the preset condition Cx, selecting the current potential dividing point ki as a data stream dividing point. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
- for a potential dividing point k, determining M windows Wx[k−
-
9. A server for searching for a data stream dividing point for dividing data into a plurality of portions to facilitate data storage according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M windows Wx[k−
Ax, k+Bx] and a preset condition Cx corresponding to the window Wx[k−
Ax, k+Bx], 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, wherein the server comprises a central processing unit and a primary memory, the central processing unit communicates with the primary memory to execute computer instructions stored therein to perform the steps of;(a) determining a corresponding window Wiz[ki−
Az, ki+Bz] for a current potential dividing point k1 according to the rule, wherein i and z are integers, and 1≦
z≦
M;(b) determining whether at least a part of data in the window Wiz[ki−
Az, ki+Bz] meets a preset condition Cz;(c) when the at least a part of data in the window Wiz[ki−
Az, ki+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 ki 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 performing step (a); and(d) when at least a part of data in each window Wix[ki−
Ax, ki+Bx] of M windows of the current potential dividing point ki meets the preset condition Cx, selecting the current potential dividing point ki as a data stream dividing point. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
- for a potential dividing point k, determining M windows Wx[k−
-
17. A non-transitory computer-readable storage medium, wherein the 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 to facilitate data storage according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M windows Wx[k−
Ax, k+Bx] and a preset condition Cx corresponding to the window Wx[k−
Ax, k+Bx], wherein x indicates consecutive natural numbers from 1 to M, M≧
2, and Ax and Bx are integers; and
for;(a) determining a corresponding window Wiz[ki−
Az, ki+Bz] for a current potential dividing point ki according to the rule, wherein i and z are integers, and 1≦
z≦
M;(b) determining whether at least a part of data in the window Wiz[ki−
Az, ki+Bz] meets a preset condition Cz; andwhen the at least a part of data in the window Wiz[ki−
Az, ki+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 ki 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 performing step (a); and(c) when at least a part of data in each window Wix[ki−
Ax, ki+Bx] of M windows of the current potential dividing point ki meets the preset condition Cx, selecting the current potential dividing point ki as a data stream dividing point. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
- for a potential dividing point k, determining M windows Wx[k−
Specification