Graph data generation method and apparatus

US2025123950A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2025123950-A1
Application numberUS-202218568506-A
CountryUS
Kind codeA1
Filing dateMay 19, 2022
Priority dateJun 24, 2021
Publication dateApr 17, 2025
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Embodiments of this specification provide a method and an apparatus for generating graph data to be applied to a benchmark test. A plurality of entity vertices and corresponding entity account vertices of the entity vertices are created by using a vertex generation framework, and an owning relationship is created between the entity vertices and the corresponding entity account vertices. A start point entity account vertex set and an endpoint entity account vertex set are determined based on the created entity account vertices by using a vertex block framework, where there is no overlapping entity account vertex between the start point entity account vertex set and the endpoint entity account vertex set. Then, an account association relationship between the entity account vertices is created based on the start point entity account vertex set and the endpoint entity account vertex set by using a vertex relationship generation framework.

First claim

Opening claim text (preview).

1 . A method for generating graph data to be applied to a benchmark test, comprising: creating a plurality of entity vertices and corresponding entity account vertices of the entity vertices; creating an owning relationship between the entity vertices and the corresponding entity account vertices; determining a start point entity account vertex set and an endpoint entity account vertex set based on the created entity account vertices, wherein there is no overlapping entity account vertex between the start point entity account vertex set and the endpoint entity account vertex set; and creating an account association relationship between the entity account vertices based on the start point entity account vertex set and the endpoint entity account vertex set. 2 . The method according to claim 1 , wherein an account vertex attribute of each entity account vertex comprises an account association attribute, and the method further comprises: creating an account attribute vertex based on the account association attribute of each entity account vertex; and creating an account attribute relationship between account attribute vertices and/or between each account attribute vertex and a corresponding entity account vertex based on the account association attribute. 3 . The method according to claim 2 , wherein the entity vertex comprises a personal vertex and an organizational vertex, the entity account vertex comprises a personal account vertex and an organizational account vertex, and the account attribute vertex comprises at least one of an account registration address, a registration phone, a login network address, and a login physical address; and the account attribute relationship comprises at least one of a location relationship, a phone registration relationship, a login network address relationship, and a login physical address relationship. 4 . The method according to claim 1 , further comprising: obtaining vertex outdegree distribution information of the entity vertices; and creating corresponding entity account vertices of the entity vertices comprises: creating the corresponding entity account vertices of the entity vertices based on the vertex outdegree distribution information. 5 . The method according to claim 1 , wherein an account vertex attribute of each entity account vertex comprises a vertex outdegree and a vertex indegree, and the creating an account association relationship between the entity account vertices based on the start point entity account vertex set and the endpoint entity account vertex set comprises: determining a selection probability of each start point entity account vertex in the start point entity account vertex set and a selection probability of each endpoint entity account vertex in the endpoint entity account vertex set based on a vertex outdegree of each start point entity account vertex and a vertex indegree of each endpoint entity account vertex; selecting at least one start point entity account vertex and a corresponding endpoint entity account vertex from the start point entity account vertex set and the endpoint entity account vertex set based on the selection probability of each start point entity account vertex and the selection probability of each endpoint entity account vertex; calculating an attribute distance between the selected start point entity account vertex and corresponding endpoint entity account vertex; determining a relationship creation probability between the selected start point entity account vertex and corresponding endpoint entity account vertex based on the calculated attribute distance; and creating an account association relationship between the selected start point entity account vertex and corresponding endpoint entity account vertex based on the relationship creation probability. 6 . The method according to claim 5 , wherein a process of creating the account association relationship is cyclically performed until no new account association relationship is created, and a relationship creation probability used in each cycle process is obtained by performing attenuation processing on a relationship creation probability in a previous cycle process. 7 . The method according to claim 5 , wherein a process of selecting the start point entity account vertex and the corresponding endpoint entity account vertex and a process of creating the account association relationship are cyclically performed until a quantity of created account association relationships reaches a predetermined quantity. 8 . The method according to claim 5 , further comprising: obtaining vertex outdegree/indegree distribution information of the entity account vertex; and determining the vertex outdegree and the vertex indegree of each entity account vertex based on the vertex outdegree/indegree distribution information. 9 . The method according to claim 5 , further comprising: obtaining social network outdegree/indegree distribution information; and creating a cognition/dependency relationship between the entity vertices based on the social network outdegree/indegree distribution information; and determining a relationship creation probability between the selected start point entity account vertex and endpoint entity account vertex based on the calculated attribute distance comprises: determining the relationship creation probability between the selected start point entity account vertex and endpoint entity account vertex based on the calculated attribute distance and a cognition/dependency relationship between entity vertices to which the selected start point entity account vertex and endpoint entity account vertex respectively belong. 10 . The method according to claim 4 , wherein creating the corresponding entity account vertices of the plurality of entity vertices based on the vertex outdegree distribution information comprises: creating the corresponding entity account vertices and service application vertices of the entity vertices based on the vertex outdegree distribution information; and creating an application relationship between each service application vertex and a corresponding entity vertex. 11 . The method according to claim 1 , further comprising: extracting a plurality of first entity vertices from the plurality of entity vertices; and creating corresponding entity account vertices of the entity vertices comprises: creating corresponding entity account vertices of the first entity vertices. 12 - 21 . (canceled) 22 . (canceled) 23 . (canceled) 24 . (canceled) 25 . (canceled) 26 . (canceled) 27 . (canceled) 28 . (canceled) 29 . A system for generating graph data to be applied to a benchmark test, comprising: at least two first devices, wherein a vertex generation framework is deployed at each first device; at least two second devices, wherein a vertex relationship generation framework is deployed at each second device; and a third device at which a vertex block framework is deployed, wherein each vertex generation framework is configured to: create a plurality of entity vertices; create corresponding entity account vertices of first entity vertices extracted by the vertex block framework; and create an owning relationship between each entity account vertex and a corresponding entity vertex; the vertex block framework is configured to extract the plurality of first entity vertices from the created entity vertices for each vertex generation framework; and extract a start point entity account vertex set and an endpoin

Assignees

Inventors

Classifications

  • for test design, e.g. generating new test cases · CPC title

  • for test execution, e.g. scheduling of test suites · CPC title

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

  • Workload generation, e.g. scripts, playback · CPC title

  • where the computing system component is a software system · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2025123950A1 cover?
Embodiments of this specification provide a method and an apparatus for generating graph data to be applied to a benchmark test. A plurality of entity vertices and corresponding entity account vertices of the entity vertices are created by using a vertex generation framework, and an owning relationship is created between the entity vertices and the corresponding entity account vertices. A start…
Who is the assignee on this patent?
Alipay Hangzhou Inf Tech Co Ltd
What technology area does this patent fall under?
Primary CPC classification G06F11/3684. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Apr 17 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).