Method and system for manipulating data

Patent metadata

Field	Value
Publication number	US-2016283479-A1
Application number	US-201415035661-A
Country	US
Kind code	A1
Filing date	Sep 26, 2014
Priority date	Nov 13, 2013
Publication date	Sep 29, 2016
Grant date	—

Abstract

The invention provides a method and system for operating data, which can improve efficiency of a user operating data having a tree structure. The method comprising: locating a first cache server in a distributed cache system after receiving a data operation request from a user; the first cache server constructing a cache tree in its own memory in accordance with information of relation between a file or folder and its parent directory in a relational database, the cache tree saving data below a root node corresponding to data specified by the data operation request in a tree structure; and locating a node where the data specified by the data operation request saved in the cache tree is located, and then operating the data in the node and returning an operation result to the user.

First claim

1 .- 10 . (canceled)

11 . A method for operating data, characterized by comprising:
locating a first cache server in a distributed cache system after receiving a data operation request from a user; the first cache server constructing a cache tree in its own memory in accordance with information of relation between a file or folder and its parent directory in a relational database, the cache tree saving data below a root node corresponding to data specified by the data operation request in a tree structure; and locating a node where the data specified by the data operation request saved in the cache tree is located, and then operating the data in the node and returning an operation result to the user.

12 . The method for operating data according to claim 11 , characterized in that the flow of constructing a cache tree in its own memory comprises:
step A: determining the root node corresponding to the data specified by the data operation request, and saving the root node in a stack; step B: judging whether or not the stack is empty, if so, stopping the flow, otherwise entering step C; step C: taking a node at a stack top out of the stack; step D: judging whether or not the node taken out of the stack is a leaf node, if so, returning to the step B, otherwise entering step E; and step E: acquiring all sub-nodes of the node taken out of the stack in the step C in the relational database in accordance with the information of the relation, saving the sub-nodes below the node taken out of the stack in the step C in the cache tree, saving the sub-nodes in the stack, and then returning to the step B.

13 . The method for operating data according to claim 11 , characterized in that the step of operating the data in the node comprises: reading/writing the data in the node, or deleting the data in the node, or newly adding a sub-node to the node, or renaming the node, or moving the node.

14 . The method for operating data according to claim 13 , characterized by further comprising saving a time stamp for operating the node in the cache tree.

15 . The method for operating data according to claim 11 , characterized in that after the step of constructing a cache tree in its own memory, the method further comprising saving a user identification of the user in the root node of the cache tree.

16 . The method for operating data according to claim 12 , characterized in that after the step of constructing a cache tree in its own memory, the method further comprising saving a user identification of the user in the root node of the cache tree.

17 . The method for operating data according to claim 13 , characterized in that after the step of constructing a cache tree in its own memory, the method further comprising saving a user identification of the user in the root node of the cache tree.

18 . The method for operating data according to claim 14 , characterized in that after the step of constructing a cache tree in its own memory, the method further comprising saving a user identification of the user in the root node of the cache tree.

19 . A system for providing data, characterized by comprising:
a locating module for locating a first cache buffer in a distributed cache system after receiving a data operation request from a user; a cache tree constructing module for constructing a cache tree in its own memory in accordance with information of relation between a file or folder and its parent directory in a relational database, the cache tree saving data below a root node corresponding to data specified by the data operation request in a tree structure; and a providing module for locating a node where the data specified by the data operation request saved in the cache tree is located, and then operating the data in the node and returning an operation result to the user.

20 . The system for providing data according to claim 19 , characterized in that the cache tree constructing module is further used for constructing the cache tree in accordance with the following flow:
step A: determining the root node corresponding to the data specified by the data operation request, and saving the root node in a stack; step B: judging whether or not the stack is empty, if so, stopping the flow, otherwise entering step C; step C: taking a node at a stack top out of the stack; step D: judging whether or not the node taken out of the stack is a leaf node, if so, returning to the step B, otherwise entering step E; and step E: acquiring all sub-nodes of the node taken out of the stack in the step C in the relational database in accordance with the information of the relation, saving the sub-nodes below the node taken out of the stack in the step C in the cache tree, saving the sub-nodes in the stack, and then returning to the step B.

21 . The system for providing data according to claim 19 , characterized in that the cache tree constructing module is further used for reading/writing the data in the node in the cache tree, or deleting the data in the node, or newly adding a sub-node to the node, or renaming the node, or moving the node.

22 . The system for providing data according to claim 21 , characterized by further comprising a time stamp module for saving a time stamp for operating the node in the cache tree.

23 . The system for providing data according to claim 19 , characterized in that the cache tree constructing module is further used for saving a user identification of the user in the root node of the cache tree.

24 . The system for providing data according to claim 20 , characterized in that the cache tree constructing module is further used for saving a user identification of the user in the root node of the cache tree.

25 . The system for providing data according to claim 21 , characterized in that the cache tree constructing module is further used for saving a user identification of the user in the root node of the cache tree.

26 . The system for providing data according to claim 22 , characterized in that the cache tree constructing module is further used for saving a user identification of the user in the root node of the cache tree.

Assignees

• Beijing Jingdong Shangke Information Tecnology Co Ltd
• Beijing Jingdong Century Trading Co Ltd

Inventors

• Xiao Yang
• Li Xinrong
• Liu Liu
• Liang Xi

Classifications

• G06F16/2246

  Trees, e.g. B+trees · CPC title

• G06F16/24552 Primary

  Database cache management · CPC title

• G06F16/284

  Relational databases · CPC title

• G06F16/172 Primary

  Caching, prefetching or hoarding of files · CPC title

• G06F16/2471 Primary

  Distributed queries · CPC title