Graph data loading

Patent metadata

Field	Value
Publication number	US-12554774-B2
Application number	US-202218572712-A
Country	US
Kind code	B2
Filing date	Oct 17, 2022
Priority date	Oct 25, 2021
Publication date	Feb 17, 2026
Grant date	Feb 17, 2026

Abstract

Embodiments of this specification provide a graph data loading method and apparatus. In the graph data loading method, in response to obtaining to-be-loaded graph data from the outside, a lock is obtained for the to-be-loaded graph data. A graph data loading identifier of the to-be-loaded graph data is determined based on a graph data loading identifier of previous loaded graph data stored in a graph data loading apparatus. Based on the graph data loading identifier of the to-be-loaded graph data, a corresponding storage location of the to-be-loaded graph data in a graph data storage space created in a local memory of a graph data processing device is determined. After the lock obtained for the to-be-loaded graph data is released, the to-be-loaded graph data is stored at the corresponding storage location in the graph data storage space.

First claim

What is claimed is:

1 . A graph data loading method, comprising:
obtaining, in response to obtaining to-be-loaded graph data, a lock for the to-be-loaded graph data; determining a graph data loading identifier of the to-be-loaded graph data based on a graph data loading identifier of previous loaded graph data stored in a graph data loading apparatus; releasing the lock obtained for the to-be-loaded graph data; and after releasing the lock, storing the to-be-loaded graph data at a corresponding storage location in a graph data storage space created in a local memory of a graph data processing device, wherein the corresponding storage location is determined based on the graph data loading identifier of the to-be-loaded graph data, wherein the graph data storage space comprises multiple memory blocks used to store graph data, each memory block has a fixed quantity of storage locations, a head address queue is maintained in the local memory of the graph data processing device, and the head address queue is used to sequentially store a head address of each memory block according to a creation time sequence; and wherein the method further comprises determining, based on the graph data loading identifier of the to-be-loaded graph data, a storage location of the to-be-loaded graph data in a graph data storage space created in a local memory of a graph data processing device, comprising: determining a storage location index of the to-be-loaded graph data in the graph data storage space based on the graph data loading identifier of the to-be-loaded graph data, wherein the storage location index comprises a memory block index of a memory block and an offset in the memory block; obtaining a head address of the memory block from the head address queue based on the memory block index; and determining the storage location of the to-be-loaded graph data in the graph data storage space according to the obtained head address of the memory block and the offset.

2 . The graph data loading method according to claim 1 , wherein storing the to-be-loaded graph data at the corresponding storage location in the graph data storage space comprises:
storing a data identifier and a data attribute of the to-be-loaded graph data at the corresponding storage location in the graph data storage space; or storing a data attribute of the to-be-loaded graph data at the corresponding storage location in the graph data storage space.

3 . The graph data loading method according to claim 1 , wherein a determining process of the storage location is performed before releasing the lock or after releasing the lock.

4 . The graph data loading method according to claim 1 , wherein storing the to-be-loaded graph data at the corresponding storage location in the graph data storage space comprises:
determining whether a data size of the to-be-loaded graph data exceeds a storage size of the corresponding storage location in the graph data storage space; and upon determining that the data size of the to-be-loaded graph data does not exceed the storage size of the corresponding storage location in the graph data storage space, storing the to-be-loaded graph data at the corresponding storage location in the graph data storage space; or upon determining that the data size of the to-be-loaded graph data exceeds the storage size of the corresponding storage location in the graph data storage space, applying for a memory space for the to-be-loaded graph data from a free memory in the local memory of the graph data processing device, storing the to-be-loaded graph data to the applied memory space, and storing a space address of the applied memory space at the corresponding storage location in the graph data storage space.

5 . The graph data loading method according to claim 1 , wherein storing the to-be-loaded graph data at the corresponding storage location in the graph data storage space comprises:
determining whether a data type of a data attribute of the to-be-loaded graph data comprises a variable type; and upon determining that the data type of the data attribute of the to-be-loaded graph data does not comprise the variable type, storing the to-be-loaded graph data at the corresponding storage location in the graph data storage space; or upon determining that the data type of the data attribute of the to-be-loaded graph data comprises the variable type, applying for a memory space for the to-be-loaded graph data from a free memory in the local memory of the graph data processing device, storing the to-be-loaded graph data to the applied memory space, and storing a space address of the applied memory space at the corresponding storage location in the graph data storage space.

6 . The graph data loading method according to claim 1 , wherein a mapping table used to record a mapping relationship between a data identifier of graph data and a graph data loading identifier is maintained in the graph data loading apparatus; and
the graph data loading method further comprises: after the graph data loading identifier of the to-be-loaded graph data is obtained, recording a mapping relationship between the obtained graph data loading identifier and a data identifier of the to-be-loaded graph data into the mapping table.

7 . A graph data loading apparatus comprising a memory and a processor, wherein the memory stores executable instructions that, in response to execution by the processor, cause the processor to perform operations comprising:
obtaining, in response to obtaining to-be-loaded graph data, a lock for the to-be-loaded graph data; determining a graph data loading identifier of the to-be-loaded graph data based on a graph data loading identifier of previous loaded graph data stored in a graph data loading apparatus; releasing the lock obtained for the to-be-loaded graph data; and after releasing the lock, storing the to-be-loaded graph data at a corresponding storage location in a graph data storage space created in a local memory of a graph data processing device, wherein the corresponding storage location is determined based on the graph data loading identifier of the to-be-loaded graph data, wherein the graph data storage space comprises multiple memory blocks used to store graph data, each memory block has a fixed quantity of storage locations, a head address queue is maintained in the local memory of the graph data processing device, and the head address queue is used to sequentially store a head address of each memory block according to a creation time sequence; and wherein the operations further comprising: determining, based on the graph data loading identifier of the to-be-loaded graph data, a storage location of the to-be-loaded graph data in a graph data storage space created in a local memory of a graph data processing device, comprising: determining a storage location index of the to-be-loaded graph data in the graph data storage space based on the graph data loading identifier of the to-be-loaded graph data, wherein the storage location index comprises a memory block index of a memory block and an offset in the memory block: obtaining a head address of the memory block from the head address queue based on the memory block index; and determining the storage location of the to-be-loaded graph data in the graph data storage space according to the obtained head address of the memory block and the offset.

8 . The graph data loading apparatus according to claim 7 , wherein storing the to- be-loaded graph data at the corresponding storage location in the graph data storage space comprises:
storing a data identifier and a data attribute of the to-be-loaded graph data at the corresponding storage location in the graph data storage space; or storing a data attri

Assignees

• Alipay Hangzhou Inf Tech Co Ltd

Inventors

• Zeng Xintan
• Zhang Guowei
• Liu Yongchao

Classifications

• G06F16/2343 Primary

  Locking methods, e.g. distributed locking or locking implementation details · CPC title

• G06F16/9024 Primary

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F9/5016

  the resource being the memory · CPC title

• G06F9/5022

  Mechanisms to release resources · CPC title

• G06F12/1009

  using page tables, e.g. page table structures · CPC title