# US 2026/0093754 A1 · Key-value pair storage methods for graph data and graph data prefetching methods

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0093754 A1
- Document ID: US20260093754A1
- Status: Published application
- Kind: A1
- Application number: 19/318,575
- Filed: 2025-09-04
- Published: 2026-04-02
- Earliest claimed: 2024-09-29
- Assignees: Alipay (Hangzhou) Information Technology Co., Ltd.
- Applicants: Alipay (Hangzhou) Information Technology Co., Ltd.
- Inventors: Shaofei WANG
- Web page: https://patentgrep.com/patent/US20260093754A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/2282: {Tablespace storage structures; Management thereof}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

One or more implementations of this specification provides key-value pair storage methods and devices for graph data. In an implementation, a key-value pair storage method includes: obtaining key-value pairs of graph composition elements, wherein values of the key-value pairs correspond to graph data of graph composition elements, keys of the key-value pairs each comprise identifier fields, wherein the identifier fields comprise a category identifier of a corresponding graph composition element of the graph composition elements, wherein the graph composition elements are at least one of nodes or edges, and storing the key-value pairs in order based on an arrangement sequence of category identifiers comprised in the keys.

## Claims

### Claim 1

A key-value pair storage method for graph data, comprising:
obtaining key-value pairs of graph composition elements, wherein values of the key-value pairs correspond to graph data of graph composition elements, keys of the key-value pairs each comprises identifier fields, wherein the identifier fields comprise a category identifier of a corresponding graph composition element of the graph composition elements, wherein the graph composition elements are at least one of nodes or edges; and
storing the key-value pairs in order based on an arrangement sequence of category identifiers comprised in the keys.

### Claim 2 (depends on 1)

The method according to claim 1, wherein:
when the graph composition elements are nodes, the category identifier comprises at least one of a node type or a first element type identifier indicating that a corresponding graph composition element is a node; and
when the graph composition elements are edges, the category identifier comprises at least one of an edge type, directivity, a connected node, or a second element type identifier indicating that a corresponding graph composition element is an edge.

### Claim 3 (depends on 1)

The method according to claim 1, wherein a key in the key-value pairs comprises a time window identifier, and wherein a value corresponding to the key is incremental data of a corresponding graph composition element within a current time window compared to data of a graph composition element within a previous time window, wherein the current time window is indicated by the time window identifier.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the identifier fields comprise a placeholder located after the category identifier, wherein the placeholder is used to adjust a byte length of at least one of a key corresponding to a node or a key corresponding to an edge to make the byte lengths of the keys consistent.

### Claim 5

A graph data prefetching method, comprising:
receiving a graph data read request for a graph database, wherein values of the key-value pairs correspond to graph data of graph composition elements, keys of the key-value pairs each comprises identifier fields, wherein the identifier fields comprise a category identifier of a corresponding graph composition element of the graph composition elements, wherein the graph composition elements are at least one of nodes or edges;
determining a key in a key-value pair of a matched graph composition element in the graph composition elements and a storage address of a key-value pair of a graph composition element in the graph composition elements corresponding to the matched graph composition element; and
retrieving, based on a prefetching address range that matches the storage address, a key-value pair stored in the prefetching address range.

### Claim 6 (depends on 5)

The method according to claim 5, wherein:
when the graph composition element is a node, the category identifier comprises at least one of a node type, a node identifier, or a first element type identifier indicating that the graph composition element is a node; and
when the graph composition element is an edge, the category identifier comprises at least one of an edge type, directivity of the edge, a connected node of the edge, or a second element type identifier indicating that the graph composition element is an edge.

### Claim 7 (depends on 5)

The method according to claim 5, wherein the key in the key-value pair further comprises a time window identifier, and wherein the determining a key in a key-value pair of a matched graph composition element in the graph composition elements comprises:
determining the target time window identifier based on a target time range comprised in the graph data read request;
identifying, in the key-value pairs, the key that comprises the target time window identifier; and
determining the storage address of a key-value pair corresponding to the key as the key value pair of the matched graph composition element.

### Claim 8

An electronic device, comprising:
at least one processor; and
one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising:
obtaining key-value pairs of graph composition elements, wherein values of the key-value pairs correspond to graph data of graph composition elements, keys of the key-value pairs each comprises identifier fields, wherein the identifier fields comprise a category identifier of a corresponding graph composition element of the graph composition elements, wherein the graph composition elements are at least one of nodes or edges; and
storing the key-value pairs in order based on an arrangement sequence of category identifiers comprised in the keys.

### Claim 9 (depends on 8)

The electronic device according to claim 8, wherein:
when the graph composition elements are nodes, the category identifier comprises at least one of a node type or a first element type identifier indicating that a corresponding graph composition element is a node; and
when the graph composition elements are edges, the category identifier comprises at least one of an edge type, directivity, a connected node, or a second element type identifier indicating that a corresponding graph composition element is an edge.

### Claim 10 (depends on 8)

The electronic device according to claim 8, wherein a key in the key-value pairs comprises a time window identifier, and wherein a value corresponding to the key is incremental data of a corresponding graph composition element within a current time window compared to data of a graph composition element within a previous time window, wherein the current time window is indicated by the time window identifier.

### Claim 11 (depends on 8)

The electronic device according to claim 8, wherein the identifier fields comprise a placeholder located after the category identifier, wherein the placeholder is used to adjust a byte length of at least one of a key corresponding to a node or a key corresponding to an edge to make the byte lengths of the keys consistent.
