Writing graph data
View Patent ↗Methods, computer-readable media and apparatuses are disclosed for graph data write. In an example, in response to receiving a first graph data write request, row lock indexes of corresponding row locks of target write objects are determined based on object identification information of the target write objects in the first graph data write request, where each target write object corresponds to a row lock. The target write objects are locked based on the row lock indexes of the target write objects; graph data write is performed for the first graph data write request after the target write objects are locked; the row locks held by the first graph data write request are unlocked after graph data of the target write objects is written; and a graph data write result is provided to a user after all the row locks held by the first graph data write request are unlocked.
1. A computer-implemented method, comprising:
determining, in response to receiving a first graph data write request initiated by a user, row lock indexes of corresponding row locks of target write objects based on object identification information of the target write objects in the first graph data write request, wherein the target write object comprises at least one of a target write vertex or a target write edge, and each target write object corresponds to a row lock;
locking the target write objects in the first graph data write request based on the row lock indexes of the target write objects;
performing graph data write for the first graph data write request after the target write objects in the first graph data write request are locked;
unlocking the row locks held by the first graph data write request after graph data of the target write objects in the first graph data write request is written; and
providing a graph data write result to the user after all the row locks held by the first graph data write request are unlocked.
2. The computer-implemented method according to claim 1 , wherein the locking the target write objects in the first graph data write request based on the row lock indexes of the target write objects comprises:
determining a locking sequence of the target write objects based on the row lock indexes of the target write objects in the first graph data write request;
locking the target write objects in the first graph data write request based on the locking sequence; and
recording locked row lock information in a write request record, wherein the locked row lock information comprises at least a row lock index of a row lock.
3. The computer-implemented method according to claim 2 , wherein the locking the target write objects in the first graph data write request based on the locking sequence comprises:
iteratively performing the following locking process for the first graph data write request until the target write objects are locked or the first graph data write request is put in a row lock wait list:
sequentially extracting a target write object not currently locked from the first graph data write request based on the locking sequence;
querying, for the target write object not currently locked based on the row lock index of the target write object, whether a corresponding row lock exists in a latch that comprises the row lock index; and
creating a row lock for the target write object not currently locked in the latch that comprises the row lock index when the corresponding row lock does not exist in the latch that comprises the row lock index; or
putting the first graph data write request in a row lock wait list of the row lock when the corresponding row lock exists in the latch that comprises the row lock index.
4. The computer-implemented method according to claim 2 , wherein the unlocking the row locks held by the first graph data write request after graph data of the target write objects in the first graph data write request is written comprises:
iteratively performing the following unlocking process for the first graph data write request until all the row locks held by the first graph data write request are unlocked:
extracting unlocked row lock information from the write request record of the first graph data write request;
querying, based on a row lock index in the unlocked row lock information, whether a graph data write request to be written exists in a corresponding row lock wait list; and
transferring an ownership of a row lock corresponding to the row lock index to a second graph data write request located at a head of the row lock wait list when the graph data write request to be written exists in the row lock wait list; or
deleting the row lock corresponding to the row lock index from a latch that comprises the row lock index when the second graph data write request to be written does not exist in the row lock wait list.
5. The computer-implemented method according to claim 4 , further comprising:
triggering an asynchronous retry of the second graph data write request to perform graph data write for the second graph data write request.
6. The computer-implemented method according to claim 5 , further comprising:
accessing a row lock wait list that comprises the second graph data write request in response to that the asynchronous retry of the second graph data write request is triggered, to determine whether a third graph data write request that can be combined for processing exists in the row lock wait list; and
combining the second graph data write request and the third graph data write request into a new graph data write request to write graph data when the third graph data write request that can be combined for processing exists in the row lock wait list.
7. The computer-implemented method according to claim 6 , wherein when graph data write is performed for the new graph data write request, a target write object that has been locked in the new graph data write request is not locked again.
8. The computer-implemented method according to claim 5 , wherein when graph data write is performed for the second graph data write request, a target write object that has been locked in the second graph data write request is not locked again.
9. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
determining, in response to receiving a first graph data write request initiated by a user, row lock indexes of corresponding row locks of target write objects based on object identification information of the target write objects in the first graph data write request, wherein the target write object comprises at least one of a target write vertex or a target write edge, and each target write object corresponds to a row lock;
locking the target write objects in the first graph data write request based on the row lock indexes of the target write objects;
performing graph data write for the first graph data write request after the target write objects in the first graph data write request are locked;
unlocking the row locks held by the first graph data write request after graph data of the target write objects in the first graph data write request is written; and
providing a graph data write result to the user after all the row locks held by the first graph data write request are unlocked.
10. The non-transitory, computer-readable medium according to claim 9 , wherein the locking the target write objects in the first graph data write request based on the row lock indexes of the target write objects comprises:
determining a locking sequence of the target write objects based on the row lock indexes of the target write objects in the first graph data write request;
locking the target write objects in the first graph data write request based on the locking sequence; and
recording locked row lock information in a write request record, wherein the locked row lock information comprises at least a row lock index of a row lock.
11. The non-transitory, computer-readable medium according to claim 10 , wherein the locking the target write objects in the first graph data write request based on the locking sequence comprises:
iteratively performing the following locking process for the first graph data write request until the target write objects are locked or the first graph data write request is put in a row lock wait list:
sequentially extracting a target write object not currently locked from the first graph data write request based on the locking sequence;
querying, for the target write object not currently locked based on the row lock index of the target write object, whether a corresponding row lock exists in a latch that comprises the row lock index; and
creating a row lock for the target write object not currently locked in the latch that comprises the row lock index when the corresponding row lock does not exist in the latch that comprises the row lock index; or
putting the first graph data write request in a row lock wait list of the row lock when the corresponding row lock exists in the latch that comprises the row lock index.
12. The non-transitory, computer-readable medium according to claim 10 , wherein the unlocking the row locks held by the first graph data write request after graph data of the target write objects in the first graph data write request is written comprises:
iteratively performing the following unlocking process for the first graph data write request until all the row locks held by the first graph data write request are unlocked:
extracting unlocked row lock information from the write request record of the first graph data write request;
querying, based on a row lock index in the unlocked row lock information, whether a graph data write request to be written exists in a corresponding row lock wait list; and
transferring an ownership of a row lock corresponding to the row lock index to a second graph data write request located at a head of the row lock wait list when the graph data write request to be written exists in the row lock wait list; or
deleting the row lock corresponding to the row lock index from a latch that comprises the row lock index when the second graph data write request to be written does not exist in the row lock wait list.
13. The non-transitory, computer-readable medium according to claim 12 , wherein the operations further comprise:
triggering an asynchronous retry of the second graph data write request to perform graph data write for the second graph data write request.
14. The non-transitory, computer-readable medium according to claim 13 , wherein the operations further comprise:
accessing a row lock wait list that comprises the second graph data write request in response to that the asynchronous retry of the second graph data write request is triggered, to determine whether a third graph data write request that can be combined for processing exists in the row lock wait list; and
combining the second graph data write request and the third graph data write request into a new graph data write request to write graph data when the third graph data write request that can be combined for processing exists in the row lock wait list.
15. An apparatus, comprising:
one or more processors; and
one or more memory devices interoperably coupled with the one or more processors and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more processors, perform operations comprising:
determining, in response to receiving a first graph data write request initiated by a user, row lock indexes of corresponding row locks of target write objects based on object identification information of the target write objects in the first graph data write request, wherein the target write object comprises at least one of a target write vertex or a target write edge, and each target write object corresponds to a row lock;
locking the target write objects in the first graph data write request based on the row lock indexes of the target write objects;
performing graph data write for the first graph data write request after the target write objects in the first graph data write request are locked;
unlocking the row locks held by the first graph data write request after graph data of the target write objects in the first graph data write request is written; and
providing a graph data write result to the user after all the row locks held by the first graph data write request are unlocked.
16. The apparatus according to claim 15 , wherein the locking the target write objects in the first graph data write request based on the row lock indexes of the target write objects comprises:
determining a locking sequence of the target write objects based on the row lock indexes of the target write objects in the first graph data write request;
locking the target write objects in the first graph data write request based on the locking sequence; and
recording locked row lock information in a write request record, wherein the locked row lock information comprises at least a row lock index of a row lock.
17. The apparatus according to claim 16 , wherein the locking the target write objects in the first graph data write request based on the locking sequence comprises:
iteratively performing the following locking process for the first graph data write request until the target write objects are locked or the first graph data write request is put in a row lock wait list:
sequentially extracting a target write object not currently locked from the first graph data write request based on the locking sequence;
querying, for the target write object not currently locked based on the row lock index of the target write object, whether a corresponding row lock exists in a latch that comprises the row lock index; and
creating a row lock for the target write object not currently locked in the latch that comprises the row lock index when the corresponding row lock does not exist in the latch that comprises the row lock index; or
putting the first graph data write request in a row lock wait list of the row lock when the corresponding row lock exists in the latch that comprises the row lock index.
18. The apparatus according to claim 16 , wherein the unlocking the row locks held by the first graph data write request after graph data of the target write objects in the first graph data write request is written comprises:
iteratively performing the following unlocking process for the first graph data write request until all the row locks held by the first graph data write request are unlocked:
extracting unlocked row lock information from the write request record of the first graph data write request;
querying, based on a row lock index in the unlocked row lock information, whether a graph data write request to be written exists in a corresponding row lock wait list; and
transferring an ownership of a row lock corresponding to the row lock index to a second graph data write request located at a head of the row lock wait list when the graph data write request to be written exists in the row lock wait list; or
deleting the row lock corresponding to the row lock index from a latch that comprises the row lock index when the second graph data write request to be written does not exist in the row lock wait list.
19. The apparatus according to claim 18 , wherein the operations further comprise:
triggering an asynchronous retry of the second graph data write request to perform graph data write for the second graph data write request.
20. The apparatus according to claim 19 , wherein the operations further comprise:
accessing a row lock wait list that comprises the second graph data write request in response to that the asynchronous retry of the second graph data write request is triggered, to determine whether a third graph data write request that can be combined for processing exists in the row lock wait list; and
combining the second graph data write request and the third graph data write request into a new graph data write request to write graph data when the third graph data write request that can be combined for processing exists in the row lock wait list.