CN114282071A - Request processing method, device and equipment based on graph database and storage medium - Google Patents
Request processing method, device and equipment based on graph database and storage medium Download PDFInfo
- Publication number
- CN114282071A CN114282071A CN202111640262.0A CN202111640262A CN114282071A CN 114282071 A CN114282071 A CN 114282071A CN 202111640262 A CN202111640262 A CN 202111640262A CN 114282071 A CN114282071 A CN 114282071A
- Authority
- CN
- China
- Prior art keywords
- attribute
- mode
- vertex
- edge
- graph database
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a request processing method, a device, equipment and a storage medium based on a graph database, wherein the graph database comprises a mode of a vertex attribute and an edge attribute, so that a user can send a data processing request to a server through a terminal to enable the server to complete the construction of graph query language by citing the attribute in the mode when the server executes corresponding business operation on the graph database according to the data processing request, and the operation difficulty of the user is reduced; moreover, when the request processing method of the graph database disclosed by the embodiment of the invention is applied to an actual production environment, different vertex attributes and different edge attributes can be quoted in the graph database through the mode, and then various service scenes can be processed by quoting the attributes of different vertices and edges with commonality through the mode, so that the development difficulty is reduced.
Description
Technical Field
The present invention relates to the field of databases, and in particular, to a method, an apparatus, a device, and a storage medium for processing a request based on a graph database.
Background
Compared with the traditional relational database, the graph database can adapt to various service scenes in a more flexible form, namely the combination of vertexes and edges, and can realize the analysis of a complex relational network by using a high-efficiency simplified graph query language.
However, as the service scene is increasingly complicated, the vertices and edges gradually contain more attributes, that is, the information corresponding to the vertices and the information corresponding to the edges are gradually enriched, and the enriched information of the vertices and the edges complicates the processing of the service scene, which leads to an increase in the development difficulty.
Disclosure of Invention
In view of this, the present invention provides a request processing method, device, apparatus and storage medium based on a graph database, which are used to improve rich vertex and edge information, so that the processing of a business scenario is complicated, and the current situation of development difficulty is increased.
In a first aspect, an embodiment of the present invention provides a request processing method based on a graph database, which is applied to a server, where the server is provided with a graph database, the graph database stores a preset number of patterns, and the patterns include vertex attributes and/or edge attributes, and the method includes:
acquiring a data processing request, wherein the data processing request comprises a vertex attribute or an edge attribute in at least one mode, or comprises at least one vertex attribute and/or edge attribute;
and executing corresponding operation on the graph database according to the data processing request.
Optionally, in an implementation manner provided by the embodiment of the present invention, the performing, according to the data processing request, a corresponding operation on the graph database includes:
if the data processing request comprises the vertex attribute or the edge attribute in the at least one mode, executing corresponding operation on the graph database according to the vertex and/or the edge corresponding to the vertex attribute or the edge attribute in the at least one mode;
and if the data processing request comprises the at least one vertex attribute and/or edge attribute, executing corresponding operation on the graph database according to the vertex and/or edge corresponding to the at least one vertex attribute and/or edge attribute.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode attribute query request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
and sending all vertex attributes or all edge attributes in the mode corresponding to the mode attribute query request to a terminal corresponding to the mode attribute query request.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode deleting request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
deleting the mode corresponding to the mode deleting request from the graph database.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode attribute deletion request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
and deleting the vertex attribute or the edge attribute in the mode corresponding to the mode attribute deletion request.
Optionally, in an implementation manner provided by the embodiment of the present invention, the patterns include a vertex pattern and an edge pattern, the vertex pattern includes a vertex attribute, and the edge pattern includes an edge attribute.
Further, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode creation request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
creating a vertex mode or an edge mode corresponding to the mode creating request in the graph database;
and storing the vertex attribute or the edge attribute corresponding to the mode creating request into the vertex mode or the edge mode corresponding to the mode creating request.
In a second aspect, an embodiment of the present invention provides a request processing apparatus based on a graph database, which is applied to a server, where the graph database is disposed in the server, and the graph database stores a preset number of patterns, where the patterns include vertex attributes and/or edge attributes, and the apparatus includes:
a request obtaining module, configured to obtain a data processing request, where the data processing request includes a vertex attribute or an edge attribute in at least one mode, or includes at least one vertex attribute and/or edge attribute;
and the execution module is used for executing corresponding operation on the graph database according to the data processing request.
In a third aspect, an embodiment of the present invention provides a computer device, including a memory and a processor, where the memory stores a computer program, and the computer program, when running on the processor, executes the method for processing a request based on a graph database as disclosed in any one of the first aspects.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, which, when run on a processor, performs the method for processing a request based on a graph database as disclosed in any one of the first aspects.
According to the request processing method based on the graph database, provided by the embodiment of the invention, based on the mode that the graph database comprises the vertex attribute and/or the edge attribute, a user sends a data processing request to the server through the terminal so that when the server executes corresponding business operation on the graph database according to the data processing request, the user can complete the construction of the graph query language by citing the attribute in the mode, and the operation difficulty of the user is reduced; moreover, when the request processing method of the graph database disclosed by the embodiment of the invention is applied to an actual production environment, different vertex attributes and different edge attributes can be quoted in the graph database through the mode, and then various service scenes can be processed by quoting the attributes of different vertices and edges with commonality through the mode, so that the development difficulty is reduced.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings required to be used in the embodiments will be briefly described below, and it should be understood that the following drawings only illustrate some embodiments of the present invention, and therefore should not be considered as limiting the scope of the present invention. Like components are numbered similarly in the various figures.
FIG. 1 is a schematic flow chart diagram illustrating a first method for graph database based request processing according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart diagram illustrating a second method for graph-based database request processing according to an embodiment of the present invention;
FIG. 3 is a schematic flow chart diagram illustrating a third method for graph database based request processing according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating an exemplary architecture of a request processing device based on a graph database according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
Hereinafter, the terms "including", "having", and their derivatives, which may be used in various embodiments of the present invention, are only intended to indicate specific features, numbers, steps, operations, elements, components, or combinations of the foregoing, and should not be construed as first excluding the existence of, or adding to, one or more other features, numbers, steps, operations, elements, components, or combinations of the foregoing.
Furthermore, the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which various embodiments of the present invention belong. The terms (such as those defined in commonly used dictionaries) should be interpreted as having a meaning that is consistent with their contextual meaning in the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein in various embodiments of the present invention.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a request processing method based on a graph database according to an embodiment of the present invention, where the request processing method based on a graph database according to an embodiment of the present invention is applied to a server, where the server is provided with a graph database, and the graph database stores a preset number of patterns, where the patterns include vertex attributes and/or edge attributes.
Specifically, the schema is schema. In a traditional database, such as the relational database management system MySQL, a relational database completes data storage and data relationship construction in the form of a two-dimensional table. A relational database may be understood as a schema that contains tables (tables), columns (columns), data types (data types), primary keys (primary keys), and foreign keys (foreign keys), in other words, a relational database may be equivalent to a schema, or a relational database must contain a schema.
The existing graph database such as Neo4j realizes schema-free, i.e. no mode, and does not depend on a two-dimensional table to complete data storage and data relationship construction. The data in the graph database is described by vertexes, edges, vertex attributes and edge attributes, and further, all the business operations of the graph database are completed through the vertexes and the edges. Compared with a relational database, the graph database can realize various service scenes in a flexible mode.
It can be understood that in the relational database of the existing schema, the target data needs to be indicated through the relationship among the tables; instead, a graph database with modeless does not have the use of tables, but rather identifies target data by vertex, edge, vertex attributes, and combinations of edge attributes.
The schema is also implemented in the request processing method based on the graph database provided by the embodiment of the present invention, but the implemented schema of the embodiment of the present invention is different from the schema of the existing relational database, and the schema in the embodiment of the present invention can be understood as "virtualization" of the vertex and the edge, that is, abstract virtualization of the vertex attribute and the edge attribute is performed, so as to encapsulate the vertex attribute of different vertices and/or the edge attribute of the edge in a data structure, so that the schema can describe different vertex attributes and/or edge attributes. Thus, the mode in the embodiment of the present invention may be understood as a demi-schema, which may be referred to as a half-mode or a hybrid mode.
Taking three types of vertexes of company, person and high management as examples, when the three types of vertexes are created in a graph database, attribute fields contained in each type of vertex are different, but certain commonality exists among the three types of vertexes obviously; if the attribute fields of each vertex are set to be the same, the three types of vertices cannot be distinguished, and the edges corresponding to the three types of vertices cannot be constructed.
The embodiment of the invention enables the vertex attributes and/or the edge attributes with the association to be packaged in one mode, thereby enabling different vertex attributes and/or different edge attributes to be quoted by the same mode, and enabling a developer to rapidly determine the associated vertex attributes and edge attributes through the mode when the developer carries out the operation.
In addition, it should be noted that the vertex attribute and the edge attribute in each mode in the embodiment of the present invention should be independent from each other, that is, two identical vertex attributes and/or identical edge attributes do not exist in one mode.
Optionally, in a feasible manner, to ensure the simplicity of writing and reading of the graph query language, the embodiment of the present invention divides the patterns into a vertex pattern and a side pattern, that is: the patterns include vertex patterns that include vertex attributes and edge patterns that include edge attributes.
It will be appreciated that two vertex patterns containing different vertex attributes should be named different names to avoid false referencing of patterns, while vertex patterns and edge patterns may be named the same name.
Based on this, the request processing method based on the graph database provided by the embodiment of the invention comprises the following steps:
s110, a data processing request is obtained, wherein the data processing request comprises vertex attributes or edge attributes in at least one mode, or comprises at least one vertex attribute and/or edge attribute.
S120, corresponding operation is executed on the graph database according to the data processing request.
That is, the graph database in the embodiment of the present invention combines mode (demi-schema) and schema-free (schema-free) to ensure that a user can arbitrarily select whether to complete an instruction such as data query through a mode, that is, the user can construct a query statement by referring to a vertex attribute and an edge attribute in the mode, and can also directly specify the original vertex attribute or edge attribute of the graph database to complete a corresponding operation.
It should be further noted that, the embodiment of the present invention does not limit the process of the server obtaining the data processing request, and the specific process may be set according to an actual situation.
As one possible approach, the process of the server obtaining the data processing request includes: after the user executes preset operation in the terminal, the terminal determines that the user wants to query data stored in a graph database of the server, further generates a corresponding Cypher query language, and generates a data processing request according to the Cypher query language to send the data processing request to the server.
Optionally, in an implementation manner provided by the embodiment of the present invention, the performing, according to the data processing request, a corresponding operation on the graph database includes:
if the data processing request comprises the vertex attribute or the edge attribute in the at least one mode, executing corresponding operation on the graph database according to the vertex and/or the edge corresponding to the vertex attribute or the edge attribute in the at least one mode;
and if the data processing request comprises the at least one vertex attribute and/or edge attribute, executing corresponding operation on the graph database according to the vertex and/or edge corresponding to the at least one vertex attribute and/or edge attribute.
That is, the server determines the corresponding entity to complete the corresponding business operation according to the vertex attribute and/or the edge attribute in the data processing request.
Therefore, the request processing method based on the graph database provided by the embodiment of the invention realizes that different vertex attributes and/or different edge attributes with relevance can be packaged in the graph database in advance in a mode, and further, when a user sends a data processing request to a server through a terminal, the different vertex attributes and/or different edge attributes with relevance can be quickly referred through the mode, so that the construction of the graph query language can be efficiently completed. Moreover, when the request processing method for the graph database disclosed by the embodiment of the invention is applied to an actual production environment, different vertex attributes and/or different edge attributes which are associated can be described in the graph database through the patterns, and then developers can refer to the attributes of different vertices and/or edges to process various service scenes through the patterns, so that the development difficulty is reduced.
Optionally, referring to fig. 2, fig. 2 is a schematic flowchart illustrating a second method for processing a request based on a graph database according to an embodiment of the present invention, that is, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a schema attribute query request;
further, S120 includes:
and S121, sending all vertex attributes and all edge attributes in the mode corresponding to the mode attribute query request to a terminal corresponding to the mode attribute query request.
That is, when the server determines that the data processing request is a mode attribute query request, the server determines a corresponding mode according to the vertex attributes or the edge attributes in the mode attribute query request, and sends all the vertex attributes and all the edge attributes in the corresponding mode to the terminal corresponding to the mode attribute query request.
It is understood that if the patterns include vertex patterns and edge patterns, and the vertex patterns and the edge patterns may be named with the same name, the pattern attribute query request sent by the terminal to the server needs to indicate whether the query is an edge pattern or a vertex pattern.
In a feasible manner, the schema attribute query request may not include the vertex attribute or the edge attribute, but the name of the schema corresponding to the schema attribute query request needs to be given, so that the server queries the corresponding vertex attribute and/or the edge attribute according to the name of the schema.
Alternatively, referring to fig. 3, fig. 3 is a schematic flow chart of a second method for processing a request based on a graph database according to an embodiment of the present invention, that is, the data processing request includes a mode deleting request;
further, S120 includes:
s122, deleting the mode corresponding to the mode deleting request from the graph database.
That is, the server determines and deletes the corresponding mode according to the vertex attribute or the edge attribute in at least one mode in the mode deletion request.
In one possible way, after deleting the pattern corresponding to the pattern deletion request in the graph database, the server also sends deletion success information to the terminal corresponding to the pattern deletion request.
In one possible approach, the schema deletion request may not include the vertex attribute or the edge attribute, but may include a name of the schema corresponding to the schema deletion request, so that the server deletes the corresponding schema according to the name of the schema.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode attribute deletion request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
and deleting the vertex attribute or the edge attribute in the mode corresponding to the mode attribute deletion request.
That is, the server deletes the corresponding attribute in the mode corresponding to the data processing request according to the vertex attribute and/or the edge attribute in the data processing request sent by the terminal. It is understood that, if the vertex attribute or the edge attribute in the data processing request does not exist in the mode corresponding to the data processing request, the server will send the mode attribute deletion failure notification information to the terminal.
It can be understood that, if one of the pattern attribute deletion requests is used to delete an attribute in a plurality of patterns, the pattern attribute deletion needs to include a relationship between each attribute and a pattern, that is, to explicitly indicate a pattern corresponding to each vertex attribute and/or edge attribute in the pattern attribute deletion, so that the server deletes the vertex attribute and/or edge attribute corresponding to each pattern.
Further, if the patterns include a vertex pattern and a side pattern, and the names of the vertex pattern and the side pattern may be the same, the pattern deletion request and the pattern attribute deletion request both need to specify whether the deleted pattern is the vertex pattern or the side pattern, so as to avoid the server from performing an erroneous deletion.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode attribute adding request. Wherein, the vertex attribute or the edge attribute in the mode attribute increasing request represents an attribute to be written into the mode corresponding to the mode attribute increasing request.
And then, the server writes the vertex attribute or the edge attribute into the mode corresponding to the data processing request according to the vertex attribute or the edge attribute in at least one mode in the data processing request.
It is understood that, if the mode attribute increasing request corresponds to a plurality of modes, the write object of each vertex attribute and/or edge attribute in the data processing request needs to be indicated, so that the server determines into which mode each attribute in the mode attribute increasing request is to be written.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode attribute modification request. The mode attribute modification request needs to include a modification object corresponding to each vertex mode and/or edge attribute, that is, it is determined which attribute in which mode is to be replaced by each attribute requested.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode creation request;
further, S120 includes:
creating a vertex mode or an edge mode corresponding to the mode creating request in the graph database;
and storing the vertex attribute or the edge attribute corresponding to the mode creating request into the vertex mode or the edge mode corresponding to the mode creating request.
That is, the server creates a vertex mode or an edge mode according to a mode creation request sent by the terminal, and writes vertex attributes or edge attributes in at least one mode in the mode creation request into the mode.
In one possible approach, the vertex attributes or edge attributes in at least one schema may not be included in the schema creation request. And when the server receives the vertex attribute or the edge attribute which does not comprise at least one mode, the server creates a vertex mode or an edge mode which does not comprise any attribute.
Optionally, in an implementation manner provided by the embodiment of the present invention, the data processing request includes a mode modification request. It should be noted that the schema in the embodiment of the present invention is used to describe the existing vertex attributes and edge attributes, and further, the modification request is only used to modify the name and other parameters of the schema, and is not used to modify the vertex attributes and the edge attributes in the schema.
In a feasible manner, in the embodiment of the present invention, when the vertex includes the vertex attribute and the edge attribute, the vertex further includes mode description information, and the mode description information is used to describe a relationship between the vertex attribute and the edge attribute in the mode, so that a developer can determine a relationship between each attribute in the mode according to the mode description information in a development process.
Corresponding to the method for processing a request based on a graph database provided by the embodiment of the present invention, an embodiment of the present invention further provides a device for processing a request based on a graph database, referring to fig. 4, where fig. 4 shows a schematic structural diagram of the device for processing a request based on a graph database provided by the embodiment of the present invention, the device 200 for processing a request based on a graph database provided by the embodiment of the present invention is applied to a server, a graph database is provided in the server, the graph database stores a preset number of patterns, the patterns include vertex attributes and/or edge attributes, and the device includes:
a request obtaining module 210, configured to obtain a data processing request, where the data processing request includes a vertex attribute or an edge attribute in at least one mode, or includes at least one vertex attribute and/or edge attribute;
the execution module 220 is configured to execute a corresponding operation on the graph database according to the data processing request.
The device for processing a request of a graph database provided in the embodiment of the present application can implement each process of the method for processing a request of a graph database in the embodiment of the method in fig. 1, and can achieve the same technical effect, and is not described herein again to avoid repetition.
The embodiment of the invention also provides computer equipment which comprises a memory and a processor, wherein the memory stores a computer program, and the computer program executes the request processing method of the graph database disclosed in the embodiment when running on the processor.
An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program runs on a processor, the computer program executes the request processing method for a graph database as disclosed in the embodiment.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative and, for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, each functional module or unit in each embodiment of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention or a part of the technical solution that contributes to the prior art in essence can be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a smart phone, a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention.
Claims (10)
1. A request processing method based on a graph database is applied to a server, the server is provided with the graph database, the graph database stores a preset number of patterns, and the patterns comprise vertex attributes and/or edge attributes, and the method comprises the following steps:
acquiring a data processing request, wherein the data processing request comprises a vertex attribute or an edge attribute in at least one mode, or comprises at least one vertex attribute and/or edge attribute;
and executing corresponding operation on the graph database according to the data processing request.
2. The method according to claim 1, wherein said performing a corresponding operation on said graph database in accordance with said data processing request comprises:
if the data processing request comprises the vertex attribute or the edge attribute in the at least one mode, executing corresponding operation on the graph database according to the vertex and/or the edge corresponding to the vertex attribute or the edge attribute in the at least one mode;
and if the data processing request comprises the at least one vertex attribute and/or edge attribute, executing corresponding operation on the graph database according to the vertex and/or edge corresponding to the at least one vertex attribute and/or edge attribute.
3. The method of claim 1, wherein the data processing request comprises a schema attribute query request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
and sending all vertex attributes or all edge attributes in the mode corresponding to the mode attribute query request to a terminal corresponding to the mode attribute query request.
4. The method of claim 1, wherein the data processing request comprises a pattern deletion request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
deleting the mode corresponding to the mode deleting request from the graph database.
5. The method of claim 1, wherein the data processing request comprises a schema attribute deletion request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
and deleting the vertex attribute or the edge attribute in the mode corresponding to the mode attribute deletion request.
6. The method of claim 1, wherein the patterns comprise vertex patterns and edge patterns, wherein the vertex patterns comprise vertex attributes, and wherein the edge patterns comprise edge attributes.
7. The method of claim 6, wherein the data processing request comprises a schema creation request;
the executing the corresponding operation on the graph database according to the data processing request comprises:
creating a vertex mode or an edge mode corresponding to the mode creating request in the graph database;
and storing the vertex attribute or the edge attribute corresponding to the mode creating request into the vertex mode or the edge mode corresponding to the mode creating request.
8. A request processing apparatus based on a graph database, applied to a server, wherein the server is provided with the graph database, the graph database stores a preset number of patterns, and the patterns include vertex attributes and/or edge attributes, and the apparatus includes:
a request obtaining module, configured to obtain a data processing request, where the data processing request includes a vertex attribute or an edge attribute in at least one mode, or includes at least one vertex attribute and/or edge attribute;
and the execution module is used for executing corresponding operation on the graph database according to the data processing request.
9. A computer arrangement comprising a memory and a processor, the memory storing a computer program which, when run on the processor, performs a method of graph database based request processing according to any of claims 1-7.
10. A computer-readable storage medium, having stored thereon a computer program which, when run on a processor, performs a method of graph database based request processing according to any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111640262.0A CN114282071A (en) | 2021-12-29 | 2021-12-29 | Request processing method, device and equipment based on graph database and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111640262.0A CN114282071A (en) | 2021-12-29 | 2021-12-29 | Request processing method, device and equipment based on graph database and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114282071A true CN114282071A (en) | 2022-04-05 |
Family
ID=80878017
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111640262.0A Pending CN114282071A (en) | 2021-12-29 | 2021-12-29 | Request processing method, device and equipment based on graph database and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114282071A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114817275A (en) * | 2022-07-01 | 2022-07-29 | 国网智能电网研究院有限公司 | Data reading and writing method, device and equipment of graph database and storage medium |
| CN114860783A (en) * | 2022-07-05 | 2022-08-05 | 国网智能电网研究院有限公司 | Graph database caching method and device, electronic equipment and readable storage medium |
-
2021
- 2021-12-29 CN CN202111640262.0A patent/CN114282071A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114817275A (en) * | 2022-07-01 | 2022-07-29 | 国网智能电网研究院有限公司 | Data reading and writing method, device and equipment of graph database and storage medium |
| CN114817275B (en) * | 2022-07-01 | 2022-09-23 | 国网智能电网研究院有限公司 | Data reading and writing method, device and equipment of graph database and storage medium |
| CN114860783A (en) * | 2022-07-05 | 2022-08-05 | 国网智能电网研究院有限公司 | Graph database caching method and device, electronic equipment and readable storage medium |
| CN114860783B (en) * | 2022-07-05 | 2022-09-27 | 国网智能电网研究院有限公司 | Graph database caching method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107644286B (en) | Workflow processing method and device | |
| CN108089893B (en) | Method and device for determining redundant resources, terminal equipment and storage medium | |
| US10068033B2 (en) | Graph data query method and apparatus | |
| CN114282071A (en) | Request processing method, device and equipment based on graph database and storage medium | |
| CN107016047A (en) | Document query, document storing method and device | |
| JP2016505956A (en) | Method, apparatus and computer readable medium for optimized data subsetting | |
| EP3812917A1 (en) | Data structure reading method and apparatus, data structure updating method and apparatus, and electronic device | |
| US20160378735A1 (en) | Metamorphic documents | |
| CN112416710A (en) | User operation recording method and device, electronic equipment and storage medium | |
| EP2951680B1 (en) | Acquiring identification of an application lifecycle management entity associated with similar code | |
| CN113254470A (en) | Data change method and device, computer equipment and storage medium | |
| CN112052157B (en) | Method, device and system for constructing test message | |
| CN116778124A (en) | Three-dimensional scene editing method, system, equipment and storage medium | |
| CN116414935A (en) | Method for distributed Search space vector data based on Elastic Search | |
| CN113687920B (en) | Object policy operation method, device and equipment of distributed system | |
| KR20210077975A (en) | Spatial indexing method and apparatus for blockchain-based geospatial data | |
| CN111753141A (en) | Data management method and related equipment | |
| CN113076086B (en) | Metadata management system and method for modeling model object using the same | |
| CN115270731A (en) | Collaborative editing method and device for mixed document | |
| CN115185458A (en) | Data writing method and device, storage medium and computer equipment | |
| CN114328018A (en) | Snapshot creating method, computing device and storage medium | |
| CN112632211A (en) | Semantic information processing method and equipment for mobile robot | |
| CN113282551B (en) | Data processing method, system and equipment | |
| CN116431848B (en) | Texture dynamic indexing method based on data pollution propagation analysis | |
| US20230195701A1 (en) | System and method for hydrating graph databases from external data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |