Method and apparatus for incremental backup based on file paths and a prefix tree

1. A method for incremental backup, comprising:

receiving a set of file paths to be backed up;

setting a threshold according to a size associated with a prefix tree;

in response to reaching the threshold, parsing, by segment, each file path in the set of file paths to construct the prefix tree, wherein the parsing of each file path in the set of file paths to construct a prefix tree comprises:

inserting each file path in the set of file paths into the prefix tree sequentially; and

in response to each file path being inserted, comparing each file path with the prefix tree, wherein a comparison time respective to the inserting of each file path is dependent upon a length of a character string;

traversing the prefix tree to read an ordered set of file paths in the prefix tree, wherein traversing the prefix tree to read the ordered set of file paths in the prefix tree comprises:

traversing the prefix tree using a depth first search to sequentially read all nodes that have values as the ordered set of file paths, wherein if after using the depth first search a traversed node is found to be an end of a file path, then a plurality of characters strings included in all the nodes along the file path from a root node to a given node merge to form a single file path; and

performing an incremental backup sequentially according to the ordered set of file paths.

2. The method according to claim 1 , wherein the file paths to be backed up at least include an alphabet and a special character.

3. The method according to claim 1 , wherein all sub-nodes of any node in the prefix tree have a common prefix that includes one or more characters.

4. The method according to claim 1 , wherein the prefix tree is initially an empty tree.

5. The method according to claim 1 , wherein the parsing each file path in the set of file paths to construct a prefix tree comprises:

allocating a common prefix of a plurality of file paths having the common prefix to a node, the common prefix including a plurality of characters.

6. The method according to claim 1 , wherein the comparing each file path with the prefix:

for each file path, performing prefix matching between the file path and nodes of a N-th layer in the prefix tree, wherein N≥1 and an initial value of N is 1:

in response to failing to find a common prefix between the file path and all nodes of the N-th layer, inserting the file path as a new node of the N-th layer; and

in response to finding a common prefix between the file path and a given node in the N-th layer, inserting the file path as a new sub-node of the given node so that initial characters of all nodes of N+1-th layer are sorted according to ASCII code sizes.

7. The method according to claim 6 , wherein the inserting the file path as a new sub-node of the given node comprises:

in response to the common prefix being a part of characters in given node, replacing characters in the given node with the common prefix.

8. The method according to claim 1 , further comprising:

in response to constructing the prefix tree, sorting all nodes in the same layer based on ASCII code sizes of initial characters in the nodes.

9. The method according to claim 1 , further comprising:

in response to constructing the prefix tree, assigning a value to a node corresponding to a file path.

10. The method according to claim 9 , wherein all nodes on the file path from a root node to a given node of the prefix tree comprises a sum of the value of a plurality of character strings.

11. A computing system including a processor and memory configured to perform operations comprising:

receiving a set of file paths to be backed up;

setting a threshold according to a size associated with a prefix tree;

in response to reaching the threshold, parsing, by segment, each file path in the set of file paths to construct the prefix tree, wherein the parsing of each file path in the set of file paths to construct a prefix tree comprises:

inserting each file path in the set of file paths into the prefix tree sequentially; and

in response to each file path being inserted, comparing each file path with the prefix tree, wherein a comparison time respective to the inserting of each file path is dependent upon a length of a character string;

traversing the prefix tree to read an ordered set of file paths in the prefix tree, wherein traversing the prefix tree to read the ordered set of file paths in the prefix tree comprises:

traversing the prefix tree using a depth first search to sequentially read all nodes that have values as the ordered set of file paths, wherein if after using the depth first search a traversed node is found to be an end of a file path, then a plurality of characters strings included in all the nodes along the file path from a root node to a given node merge to form a single file path; and

performing an incremental backup sequentially according to the ordered set of file paths.

12. The computing system according to claim 11 , wherein the file paths to be backed up at least include an alphabet and a special character.

13. The computing system according to claim 11 , wherein all sub-nodes of any node in the prefix tree have a common prefix that includes one or more characters.

14. The computing system according to claim 11 , wherein the prefix tree is initially an empty tree.

15. The computing system according to claim 11 , further configured to perform operations comprising:

allocate a common prefix of a plurality of file paths having the common prefix to a node, the common prefix including a plurality of characters.

16. The computing system according to claim 15 , further configured to perform operations comprising:

for each file path, perform prefix matching between the file path and nodes of a N-th layer in the prefix tree, wherein N≥1 and an initial value of N is 1:

in response to failing to find a common prefix between the file path and all nodes in the N-th layer, insert the file path as a new node of the N-th layer; and

in response to finding a common prefix between the file path and a given node in the N-th layer, insert the file path as a new sub-node of the given node so that initial characters of all nodes of N+1-th layer are sorted according to ASCII code sizes.

17. The computing system according to claim 16 , further configured to perform operations comprising:

in response to the common prefix being a part of characters in given node, replace characters in the given node with the common prefix.

18. A computer program product residing on a non-transitory computer readable program instructions embodied therein, the computer readable program instructions, when being executed by a processor, cause the processor to execute:

receiving a set of file paths to be backed up;

setting a threshold according to a size associated with a prefix tree;

in response to reaching the threshold, parsing, by segment, each file path in the set of file paths to construct the prefix tree, wherein the parsing of each file path in the set of file paths to construct a prefix tree comprises:

inserting each file path in the set of file paths into the prefix tree sequentially; and

in response to each file path being inserted, comparing each file path with the prefix tree, wherein a comparison time respective to the inserting of each file path is dependent upon a length of a character string;

traversing the prefix tree to read an ordered set of file paths in the prefix tree, wherein traversing the prefix tree to read the ordered set of file paths in the prefix tree comprises:

traversing the prefix tree using a depth first search to sequentially read all nodes that have values as the ordered set of file paths, wherein if after using the depth first search a traversed node is found to be an end of a file path, then a plurality of characters strings included in all the nodes along the file path from a root node to a given node merge to form a single file path; and

performing an incremental backup sequentially according to the ordered set of file paths.