METHOD AND SERVER FOR SEARCHING FOR DATA STREAM DIVIDING POINT BASED ON SERVER
First Claim
1. A method performed by a processor configured to execute instructions stored in memory, the method for selecting for a data stream dividing point to break a large amount of data into a plurality of blocks of data according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M points px, a window Wx[px−
Ax, px+Bx] corresponding to the point px, and a preset condition Cx corresponding to the window Wx[px−
Ax, px+Bx], wherein x indicates consecutive natural numbers from 1 to M, M≧
2, and Ax and Bx are integers, the method comprising;
(a) determining a point piz and a window Wiz[piz−
Az, piz+Bz] corresponding to the point piz 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[piz−
Az, piz+Bz] meets a preset condition Cz; and
when the at least a part of data in the window Wiz[piz−
Az, piz+Bz] does not meet the preset condition Cz, skipping N minimum units U for searching for a data stream dividing point from the point piz along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥
Bz∥
+maxx(∥
Ax∥
+∥
(ki−
pix)∥
), 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[pix−
Ax, pix+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 processor configured to execute instructions stored in memory, the method for selecting for a data stream dividing point to break a large amount of data into a plurality of blocks of data according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M points px, a window Wx[px−
Ax, px+Bx] corresponding to the point px, and a preset condition Cx corresponding to the window Wx[px−
Ax, px+Bx], wherein x indicates consecutive natural numbers from 1 to M, M≧
2, and Ax and Bx are integers, the method comprising;(a) determining a point piz and a window Wiz[piz−
Az, piz+Bz] corresponding to the point piz 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[piz−
Az, piz+Bz] meets a preset condition Cz; andwhen the at least a part of data in the window Wiz[piz−
Az, piz+Bz] does not meet the preset condition Cz, skipping N minimum units U for searching for a data stream dividing point from the point piz along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥
Bz∥
+maxx(∥
Ax∥
+∥
(ki−
pix)∥
), 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[pix−
Ax, pix+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 points px, a window Wx[px−
-
9. A server for searching for a data stream dividing point according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M points px, a window Wx[px−
Ax, px+Bx] corresponding to the point px, and a preset condition Cx corresponding to the window Wx[px−
Ax, px+Bx], wherein x indicates consecutive natural numbers from 1 to M, M≧
2, and Ax and Bx are integers, the server comprises a central processing unit and a memory for storing computer instructions, wherein the central processing unit communicates with the memory to retrieve and execute the computer instructions to perform the steps of;(a) determining a point piz and a window Wiz[piz−
Az, piz+Bz] corresponding to the point piz 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[piz−
Az, piz+Bz] meets a preset condition Cz; andwhen the at least a part of data in the window Wiz[piz−
Az, piz+Bz] does not meet the preset condition Cz, skipping N minimum units U for searching for a data stream dividing point from the point piz along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥
Bz∥
+maxx (∥
Ax∥
+∥
pix)∥
), 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[pix−
Ax, pix+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 points px, a window Wx[px−
-
17. A computer-readable storage medium, wherein the computer-readable storage medium is configured to store executable instructions that, when executed by a processors, prompts the processor to search for a data stream dividing point according to a rule, wherein the rule comprising:
- for a potential dividing point k, determining M points px, a window Wx[px−
Ax, px+Bx] corresponding to the point px, and a preset condition Cx corresponding to the window Wx[px−
Ax, px+Bx], wherein x indicates consecutive natural numbers from 1 to M, M≧
2, and Ax and Bx are integers, and;(a) determining piz and a window Wiz[piz−
Az, piz+Bz] corresponding to piz 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[piz−
Az, piz+Bz] meets a preset condition Cz; andwhen the at least a part of data in the window Wiz[piz−
Az, piz+Bz] does not meet the preset condition Cz, skipping N minimum units U for searching for a data stream dividing point from the point piz along a direction of searching for a data stream dividing point, wherein N*U is not greater than ∥
Bz∥
+maxx (∥
Ax∥
+∥
(ki−
pix)∥
), 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[pix−
Ax, pix+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 points px, a window Wx[px−
Specification