CN112015819A - Data updating method, device, equipment and medium for distributed graph database - Google Patents
Data updating method, device, equipment and medium for distributed graph database Download PDFInfo
- Publication number
- CN112015819A CN112015819A CN202010899494.7A CN202010899494A CN112015819A CN 112015819 A CN112015819 A CN 112015819A CN 202010899494 A CN202010899494 A CN 202010899494A CN 112015819 A CN112015819 A CN 112015819A
- Authority
- CN
- China
- Prior art keywords
- data
- record
- updating
- information
- value
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
Abstract
The invention discloses a data updating method of a distributed graph database, relates to the field of databases, and aims to efficiently update specified data records. The method comprises the following steps: receiving a data updating request, wherein the data updating request comprises data records to be updated and updating information; querying whether the data record is valid; if the data is invalid, returning the information of failed update or performing data insertion processing; if the key-value record is valid, continuously judging whether the data record meets a preset filtering condition, and if the key-value record meets the preset filtering condition, updating the value of the data record according to the updating information to obtain a new key-value record; writing the new key-value record. The invention also discloses a data updating device of the distributed graph database, electronic equipment and a computer storage medium.
Description
Technical Field
The present invention relates to the field of databases, and in particular, to a method, an apparatus, a device, and a medium for updating data of a distributed graph database.
Background
With the rapid development of big data and artificial intelligence, a very large scale relational network is widely applied in the fields of recommendation systems, social networks, security prevention and control, internet of things and the like step by step, a distributed graph database is one of the technical cornerstones for realizing all the applications, and the large scale distributed relational network is stored through the distributed graph database.
Relational networks are usually based on Graph theory (Graph) in data structures, and the core elements constituting an attribute Graph are two: nodes (also called points) and attributes on nodes, relationships (also called edges) and attributes on relationships. Typically, the amount of data for these relational networks is very large, at least with hundreds of millions of nodes, and hundreds of billions to hundreds of billions of edges, and thus distributed graph databases are the first choice for storing relational networks.
Because the data of the relational network is changed in real time, how to efficiently change the specific attributes of a specific data record in a huge data storage and how to efficiently insert the data record are problems to be solved at present.
Disclosure of Invention
In order to overcome the defects of the prior art, an object of the present invention is to provide a data updating method for a distributed graph database, which improves the data updating efficiency.
One of the purposes of the invention is realized by adopting the following technical scheme:
a method for updating data in a distributed graph database, comprising the steps of:
receiving a data updating request, wherein the data updating request comprises data records to be updated and updating information;
querying whether the data record is valid;
if the data is invalid, returning the information of failed update or performing data insertion processing;
if the key-value record is valid, continuously judging whether the data record meets a preset filtering condition, and if the key-value record meets the preset filtering condition, updating the value of the data record according to the updating information to obtain a new key-value record;
writing the new key-value record.
Further, the data insertion process is performed, including:
and generating a new key-value record according to the schema information of the data record and the update information, wherein the update information is field information to be updated.
Further, before writing the new key-value record, the method includes:
inquiring whether the data record has index information, if so, deleting the index information, inserting the index information of the new key-value record, and if the insertion of the index information fails, returning information of failed update;
if no index information exists, no processing is performed.
Further, querying whether the data record is valid comprises:
querying whether the data record exists;
if yes, continuing to judge whether the data record is overdue;
if the data record exists and the data record is not expired, judging that the data record has an effect; otherwise, the data record is judged to be invalid.
Further, comprising:
if the preset filtering condition is not met, returning the information of failed updating;
if the value of the data record fails to be updated, returning the information of failure in updating;
and if the key-value is failed to be written, returning the information of failure in updating.
Further, if the data record is a relationship record, after writing the new key-value record, the method further includes:
and synchronously updating the related relation record of the data record through the new key-value record.
The second objective of the present invention is to provide a data updating device for a distributed graph database, which is used to improve the data updating efficiency of the distributed graph database.
The second purpose of the invention is realized by adopting the following technical scheme:
a data update apparatus for a distributed graph database, comprising:
the system comprises a receiving module, a processing module and a processing module, wherein the receiving module is used for receiving a data updating request, and the data updating request comprises data records to be updated and updating information;
the query judging module is used for querying whether the data record is valid; if the data is invalid, returning the information of failed update or performing data insertion processing; if the data record is valid, continuously judging whether the data record meets a preset filtering condition;
the data updating module is used for updating the value of the data record according to the updating information under the condition that the data record meets the preset filtering condition to obtain a new key-value record;
and the data writing module is used for writing the new key-value record.
Further, still include:
the data adding module is used for performing data insertion processing and comprises: and generating a new key-value record according to the schema information and the update information of the data record.
It is a further object of the present invention to provide an electronic device for performing one of the objects of the invention, comprising a processor, a storage medium and a computer program, the computer program being stored in the storage medium, the computer program, when executed by the processor, implementing the above-mentioned method for updating data of a distributed database.
It is a fourth object of the present invention to provide a computer-readable storage medium storing one of the objects of the invention, having stored thereon a computer program which, when executed by a processor, implements the above-described data updating method for a distributed graph database.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a method for changing attributes and inserting records on nodes and relations in a distributed graph database, which can efficiently realize the updating and inserting of data records and improve the data updating efficiency of the distributed graph database.
Drawings
FIG. 1 is a schematic flow chart diagram of a method for updating data in a distributed graph database according to the present invention;
FIG. 2 is a schematic flow diagram of a method for update of data performed by an update on a distributed database;
FIG. 3 is a schematic flow diagram of a method for upsert execution of a data update of a distributed graph database;
FIG. 4 is a block diagram showing a configuration of a data updating apparatus of a distributed map database according to embodiment 2;
fig. 5 is a block diagram of the electronic apparatus of embodiment 3.
Detailed Description
The present invention will now be described in more detail with reference to the accompanying drawings, in which the description of the invention is given by way of illustration and not of limitation. May be combined with each other to constitute other embodiments not shown in the following description.
Example 1
The embodiment provides a data updating method of a distributed graph database, which aims to update data records and insert the data records quickly and efficiently and improve the data updating efficiency.
Fig. 1 is a schematic flow chart of a data updating method for a distributed graph database according to the present invention, and as shown in fig. 1, the data updating method for a distributed graph database according to the present embodiment specifically includes the following steps:
s110: receiving a data updating request, wherein the data updating request comprises data records to be updated and updating information;
s120: querying whether the data record is valid;
s130: if the data is invalid, returning the information of failed update or performing data insertion processing;
s140: if the key-value record is valid, continuously judging whether the data record meets a preset filtering condition, and if the key-value record meets the preset filtering condition, updating the value of the data record according to the updating information to obtain a new key-value record;
s150: writing the new key-value record.
The embodiment adopts an open-source-based distributed database Nebula Graph as a Graph database for storing nodes and edges of a relational network (Graph). In other embodiments, other graph databases may be used, and the selection of a particular graph database does not affect the performance of the method of the present invention, and thus is not particularly limited.
When the Nebula Graph stores the nodes and the edges of the Graph, the nodes consist of labels and corresponding attributes, one node at least has one type of label or multiple types of labels, and the attribute corresponding to the node is called schema. An edge represents the relationship between labels of two nodes, the edge is composed of types and corresponding attributes, wherein a group of attributes of the edge is called schema, the edges are directed edges, one edge in a graph database can be modeled into two independent key-value records which are respectively called an outgoing edge and an incoming edge, therefore, the types of the edge comprise an outgoing edge or an incoming edge, a reverse edge of the outgoing edge is called an incoming edge, and a reverse edge of the incoming edge is an outgoing edge.
The invention can realize updating the data of the distributed database Nebula Graph, realize updating the data record of the node and the data record of the relationship through updatetex/edge and updatetex/edge in the query statement, and mainly realize updating the attribute corresponding to a single label (the single label of the single node) or the attribute of the relationship (edge).
And receiving a data updating request, wherein the data request can be used for initiating data updating operation and carrying parameters for data updating. For example, if the attribute of the data record of the specified label or the specified relationship is updated, that is, the key-value record is updated, the parameters received by the data update request are: and specifying a label or a data record of a specified relationship and an attribute value to be updated of the data record, wherein the attribute value to be updated is field information to be updated. It should be noted that the key in the key-value record is an attribute of a specific tag/specific relationship in this embodiment, and the value is obtained by sequentially splicing field information corresponding to each attribute. For example: the key value of vertex consists of: key is partitionId + VertexId + TagId + Version, and Value is the Value of a plurality of attributes spliced according to the sequence of the schema. The key value of Edge consists of: key is partitionId + srcId + edgeType + edgeRank + dstId + version, and Value is the Value of a plurality of attributes spliced according to the sequence of schema.
When the data updating process is realized through updatevertex/edge, if the data record to be updated is found to be invalid, the updating failure information is returned.
When the updating process is realized through upservertex/edge, if the data record to be updated is found to be invalid, data insertion processing is executed.
Preferably, a data insertion process is performed, comprising:
and generating a new key-value record according to the schema information of the data record and the update information, wherein the update information is field information to be updated. And the schema information of the data record is the attribute information of the data record.
It should be noted that, no matter whether the above method is implemented by updatevertex/edge or updatevertex/edge, the value of the data record is updated to obtain a new key-value record, or the new key-value record generated by data insertion processing is finally written into the database.
Preferably, in a preferred embodiment of the present invention, before writing the new key-value record, the method further includes:
inquiring whether the data record has index information, if so, deleting the index information, inserting the index information of the new key-value record, and if the insertion of the index information fails, returning information of failed update;
if the index information does not exist, processing is not carried out, and the next step is directly executed: writing the new key-value record.
Preferably, querying whether the data record is valid comprises:
querying whether the data record exists;
if yes, continuing to judge whether the data record is overdue;
if the data record exists and the data record is not expired, judging that the data record has an effect; otherwise, the data record is judged to be invalid.
In this embodiment, whether the data record is expired is determined, and the TTL of the data record is used to determine whether the data record is expired, where the TTL is the lifetime of the data record, and when the TTL is expired, it indicates that the data record is expired, and the data record is invalid. If the data record does not contain the TTL, inquiring that the data record does not exist, directly judging that the data record is invalid, and not continuing to judge the TTL; and similarly, if the data record exists, judging that the data record is effective.
Preferably, the method comprises the following steps:
if the preset filtering condition is not met, returning the information of failed updating;
if the value of the data record fails to be updated, returning the information of failure in updating;
and if the key-value is failed to be written, returning the information of failure in updating.
In one embodiment of the present invention, when the method for updating data of a distributed graph database is executed, each step is executed, whether the step is executed successfully is determined, and if the step is not executed successfully, an error is reported, and information of updating failure is returned.
Preferably, if the data record is a relationship record, after writing the new key-value record, the method further includes:
and synchronously updating the related relation record of the data record through the new key-value record.
If the data record is a relationship record (data record of relationship), it indicates that the attribute of the side is updated. Because the attributes of the outgoing edge and the incoming edge of the same edge in the same logical sense are completely the same, when the attribute update of the edge is completed, the reverse edge of the edge also needs to be synchronously updated, if the edge is the incoming edge, the corresponding outgoing edge is updated, and if the edge is the outgoing edge, the incoming edge is updated, so as to keep the attributes of the outgoing edge and the incoming edge completely the same.
Because an edge is partitioned according to its starting point, the occurrence of an edge in the same logical sense and the occurrence of an edge in the same logical sense may be on different partitions, and different partitions may be on different machines. Therefore, distributed transactions are used to ensure that the attributes of the update out edge and the attributes of the input edge are one atomic operation, and the whole process is a read _ modify _ write operation, and the transaction and the locking are respectively used to ensure the reliability of data.
Fig. 2 is a schematic flow chart of a method for updating data of a distributed database by update, and as shown in fig. 2, taking an update node as an example, the update vertex includes the following steps:
step 1: a data record for the specified label for the specified node is looked up for presence. If the data record does not exist, reporting an error and returning failure information; if the data record exists, continuing to execute the step 2.
Step 2: and judging whether the label contains TTL or not, and if so, judging whether the data record is overdue or not. If the time is expired, reporting an error and returning failure information; otherwise, judging that the record is valid (including the two cases of existence and no TTL of the data record and existence and unexpired TTL of the record), and continuing to execute the step 3.
And step 3: and judging whether the filtering condition is met, if the filtering condition is not met, reporting an error, returning failure information, and returning filtered information along with the failure information, otherwise, continuing to execute the step 4.
And 4, step 4: and generating a new value according to the latest schema information of the tag, the field information to be updated and the read original value. And forming a new key-value record by the original key part and the new value part.
And 5: and if the original data record contains the index information, deleting the original index information, inserting the index information of the new key-value record, and writing the index information of the new key-value record and the new key-value record generated in the step 4 into the database. And if the original data record has no index information, writing the new key-value record generated in the step 4 into the database.
Step 6: if the step 5 is successful, returning the information of successful update and the attribute value which needs to be returned after successful update, otherwise, returning the failure information.
The entire operation step is a read _ modify _ write operation, where transactions and locking are used to ensure the reliability of the data.
FIG. 3 is a flowchart illustrating a method for upsert to perform data update of a distributed graph database. As shown in fig. 3, taking the update node as an example, the steps of upservt vertex are as follows:
step 1: a data record for the specified label for the specified node is looked up for presence. If the data record does not exist, executing the step 4-1; if the data record exists, continuing to execute the step 2.
Step 2: and judging whether the label contains TTL or not, and if so, judging whether the data record is overdue or not. If yes, executing step 4-1; otherwise, judging that the record is valid (including the two cases of existence and no TTL of the data record and existence and unexpired TTL of the record), and continuing to execute the step 3.
And step 3: and judging whether the filtering condition is met, if the filtering condition is not met, reporting an error, returning failure information, and returning filtered information along with the failure information, otherwise, continuing to execute the step 4-2.
And 4, step 4: 4-1: and forming a new key-value record by generating keys and values according to the latest schema information and the field information to be updated of the tags for insertion.
4-2: and generating a new value according to the latest schema information of the tag, the field information to be updated and the read original value. And forming a new key-value record by the original key part and the new value part.
And 5: and if the original data record contains the index information, deleting the original index information, inserting the index information of the new key-value record, and writing the index information of the new key-value record and the new key-value record generated in the step 4 into the database. And if the original data record has no index information, writing the new key-value record generated in the step 4 into the database.
Step 6: if the step 5 is successful, returning the information of successful update and the attribute value which needs to be returned after successful update, otherwise, returning the failure information.
The entire operation step is a read _ modify _ write operation, where transactions and locking are used to ensure the reliability of the data.
The logic of update/update edge is basically the same as the logic and steps of update/update vertex described above, and will not be repeated here.
Example 2
The present embodiment of the invention discloses a device corresponding to the method for updating data of a distributed graph database in embodiment 1, which is a virtual structure device, and fig. 4 is a block diagram of a data updating device of a distributed graph database in embodiment 2, and as shown in fig. 4, the method includes:
a receiving module 410, configured to receive a data update request, where the data update request includes a data record to be updated and update information;
a query determining module 420, configured to query whether the data record is valid; if the data is invalid, returning the information of failed update or performing data insertion processing; if the data record is valid, continuously judging whether the data record meets a preset filtering condition;
the data updating module 430 is configured to update the value of the data record according to the update information when the data record meets the preset filtering condition, so as to obtain a new key-value record;
a data writing module 440, configured to write the new key-value record.
Preferably, the method further comprises the following steps:
a data adding module (not depicted) for performing data insertion processing, comprising: and generating a new key-value record according to the schema information and the update information of the data record.
Example 3
Fig. 5 is a schematic structural diagram of an electronic device according to embodiment 3 of the present invention, and as shown in fig. 5, an electronic device is provided, where the electronic device may be a server, and a structural diagram of the electronic device may be as shown in fig. 5. The electronic device comprises a processor, a memory, an input device and an output device; wherein the number of processors in the electronic device may be one or more, and one processor is taken as an example in fig. 5; the processor, memory, input devices and output devices in the electronic apparatus may be connected by a bus or other means, and fig. 5 illustrates the connection by a bus as an example.
The memory, which is a computer-readable storage medium, may include a high-speed random access memory, a non-volatile memory, etc., which may be used to store an operating system, software programs, computer-executable programs, and databases, and may also include a memory, which may be used to provide a running environment for the operating system and the computer programs. The processor is used to provide computing and control capabilities, and executes various functional applications and data processing of the electronic device, that is, to implement the data updating method of the distributed map database of embodiment 1, by executing computer-executable programs, software programs, instructions, and modules stored in the memory.
The output device of the electronic equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the electronic equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on a shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
The electronic device may further include a network interface for communicating with an external terminal through a network connection. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
Those skilled in the art will appreciate that the configuration shown in fig. 5 is a block diagram of only a portion of the configuration associated with the present application, and does not constitute a limitation on the electronic device to which the present application is applied, and a particular electronic device may include more or less components than those shown in the drawings, or may combine certain components, or have a different arrangement of components.
It will be understood by those skilled in the art that all or part of the processes of the method of embodiment 1 may be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and the computer program, when executed, may include the processes of the embodiments of the methods. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
Example 4
Embodiment 4 of the present invention also provides a storage medium containing computer-executable instructions, which when executed by a computer processor, implement a data update method for a distributed graph database, the method including:
receiving a data updating request, wherein the data updating request comprises data records to be updated and updating information;
querying whether the data record is valid;
if the data is invalid, returning the information of failed update or performing data insertion processing;
if the key-value record is valid, continuously judging whether the data record meets a preset filtering condition, and if the key-value record meets the preset filtering condition, updating the value of the data record according to the updating information to obtain a new key-value record;
writing the new key-value record.
Of course, the storage medium provided by the embodiment of the present invention contains computer-executable instructions, and the computer-executable instructions are not limited to the operations of the method described above, and may also perform related operations in the data updating method for the distributed graph database provided by any embodiment of the present invention.
From the above description of the embodiments, it is obvious for those skilled in the art that the present invention can be implemented by software and necessary general hardware, and certainly, can also be implemented by hardware, but the former is a better embodiment in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, and includes instructions for enabling an electronic device (which may be a mobile phone, a personal computer, a server, or a network device) to execute the methods according to the embodiments of the present invention.
It should be noted that, in the embodiment of the method or the apparatus for updating data in a distributed graph database, the included units and modules are only divided according to functional logic, but are not limited to the above division as long as the corresponding functions can be realized; in addition, specific names of the functional units are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present invention.
Various other modifications and changes may be made by those skilled in the art based on the above-described technical solutions and concepts, and all such modifications and changes should fall within the scope of the claims of the present invention.
Claims (10)
1. A method for updating data in a distributed graph database, comprising the steps of:
receiving a data updating request, wherein the data updating request comprises data records to be updated and updating information;
querying whether the data record is valid;
if the data is invalid, returning the information of failed update or performing data insertion processing;
if the key-value record is valid, continuously judging whether the data record meets a preset filtering condition, and if the key-value record meets the preset filtering condition, updating the value of the data record according to the updating information to obtain a new key-value record;
writing the new key-value record.
2. The method for updating data in a distributed graph database according to claim 1, wherein said performing data insertion processing includes:
and generating a new key-value record according to the schema information of the data record and the update information, wherein the update information is field information to be updated.
3. The method for updating data in a distributed graph database according to claim 1, wherein said writing said new key-value record is preceded by:
inquiring whether the data record has index information, if so, deleting the index information, inserting the index information of the new key-value record, and if the insertion of the index information fails, returning information of failed update;
if no index information exists, no processing is performed.
4. The method for updating data in a distributed graph database as claimed in claim 1, wherein said querying whether said data record is valid comprises:
querying whether the data record exists;
if yes, continuing to judge whether the data record is overdue;
if the data record exists and the data record is not expired, judging that the data record has an effect; otherwise, the data record is judged to be invalid.
5. The method for updating data in a distributed graph database according to claim 1, comprising:
if the preset filtering condition is not met, returning the information of failed updating;
if the value of the data record fails to be updated, returning the information of failure in updating;
and if the key-value is failed to be written, returning the information of failure in updating.
6. The method for updating data in a distributed graph database according to any of claims 1-5, wherein if said data record is a relationship record, after writing said new key-value record, further comprising:
and synchronously updating the related relation record of the data record through the new key-value record.
7. A data updating apparatus for a distributed graph database, comprising:
the system comprises a receiving module, a processing module and a processing module, wherein the receiving module is used for receiving a data updating request, and the data updating request comprises data records to be updated and updating information;
the query judging module is used for querying whether the data record is valid; if the data is invalid, returning the information of failed update or performing data insertion processing; if the data record is valid, continuously judging whether the data record meets a preset filtering condition;
the data updating module is used for updating the value of the data record according to the updating information under the condition that the data record meets the preset filtering condition to obtain a new key-value record;
and the data writing module is used for writing the new key-value record.
8. The data updating apparatus for a distributed map database according to claim 7, further comprising:
the data adding module is used for performing data insertion processing and comprises: and generating a new key-value record according to the schema information and the update information of the data record.
9. An electronic device comprising a processor, a storage medium, and a computer program stored in the storage medium, wherein the computer program, when executed by the processor, implements a method for data update of a distributed map database according to any of claims 1 to 6.
10. A computer-readable storage medium on which a computer program is stored, the computer program, when being executed by a processor, implementing a data updating method for a distributed map database according to any one of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010899494.7A CN112015819A (en) | 2020-08-31 | 2020-08-31 | Data updating method, device, equipment and medium for distributed graph database |
| US17/303,669 US11693843B2 (en) | 2020-08-31 | 2021-06-04 | Data processing method and system of a distributed graph database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010899494.7A CN112015819A (en) | 2020-08-31 | 2020-08-31 | Data updating method, device, equipment and medium for distributed graph database |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112015819A true CN112015819A (en) | 2020-12-01 |
Family
ID=73503109
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010899494.7A Pending CN112015819A (en) | 2020-08-31 | 2020-08-31 | Data updating method, device, equipment and medium for distributed graph database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112015819A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112860953A (en) * | 2021-01-27 | 2021-05-28 | 国家计算机网络与信息安全管理中心 | Data importing method, device, equipment and storage medium of graph database |
| CN113326276A (en) * | 2021-06-23 | 2021-08-31 | 北京金山数字娱乐科技有限公司 | Graph database updating method and device |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102110121A (en) * | 2009-12-24 | 2011-06-29 | 阿里巴巴集团控股有限公司 | Method and system for processing data |
| CN102193991A (en) * | 2011-03-25 | 2011-09-21 | 北京世纪互联工程技术服务有限公司 | OLTP(on-line transaction processing)-based data modifying method and system as well as graphic database server |
| CN103345501A (en) * | 2013-06-27 | 2013-10-09 | 华为技术有限公司 | Method and device for updating database |
| CN103473239A (en) * | 2012-06-08 | 2013-12-25 | 腾讯科技（深圳）有限公司 | Method and device for updating data of non relational database |
| CN105468637A (en) * | 2014-09-05 | 2016-04-06 | 北京联嘉众赢网络技术有限公司 | Database updating method and apparatus |
| US20170228418A1 (en) * | 2016-02-04 | 2017-08-10 | International Business Machines Corporation | Efficiently committing large transactions in a graph database |
| US20180011887A1 (en) * | 2016-07-08 | 2018-01-11 | Ebay Inc. | Multiple database updates using paths |
| CN109299340A (en) * | 2018-12-03 | 2019-02-01 | 江苏警官学院 | A kind of microblog users forwarding relationship importing and method for visualizing based on chart database |
| CN110598059A (en) * | 2019-09-16 | 2019-12-20 | 北京百度网讯科技有限公司 | Database operation method and device |
| CN110717056A (en) * | 2019-09-03 | 2020-01-21 | 平安科技（深圳）有限公司 | Noe4j graph database updating maintenance method, device and computer readable storage medium |
| CN110807067A (en) * | 2019-09-29 | 2020-02-18 | 北京淇瑀信息科技有限公司 | Data synchronization method, device and equipment for relational database and data warehouse |
| CN111309750A (en) * | 2020-03-31 | 2020-06-19 | 中国邮政储蓄银行股份有限公司 | Data updating method and device for graph database |
-
2020
- 2020-08-31 CN CN202010899494.7A patent/CN112015819A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102110121A (en) * | 2009-12-24 | 2011-06-29 | 阿里巴巴集团控股有限公司 | Method and system for processing data |
| CN102193991A (en) * | 2011-03-25 | 2011-09-21 | 北京世纪互联工程技术服务有限公司 | OLTP(on-line transaction processing)-based data modifying method and system as well as graphic database server |
| CN103473239A (en) * | 2012-06-08 | 2013-12-25 | 腾讯科技（深圳）有限公司 | Method and device for updating data of non relational database |
| CN103345501A (en) * | 2013-06-27 | 2013-10-09 | 华为技术有限公司 | Method and device for updating database |
| CN105468637A (en) * | 2014-09-05 | 2016-04-06 | 北京联嘉众赢网络技术有限公司 | Database updating method and apparatus |
| US20170228418A1 (en) * | 2016-02-04 | 2017-08-10 | International Business Machines Corporation | Efficiently committing large transactions in a graph database |
| US20180011887A1 (en) * | 2016-07-08 | 2018-01-11 | Ebay Inc. | Multiple database updates using paths |
| CN109299340A (en) * | 2018-12-03 | 2019-02-01 | 江苏警官学院 | A kind of microblog users forwarding relationship importing and method for visualizing based on chart database |
| CN110717056A (en) * | 2019-09-03 | 2020-01-21 | 平安科技（深圳）有限公司 | Noe4j graph database updating maintenance method, device and computer readable storage medium |
| CN110598059A (en) * | 2019-09-16 | 2019-12-20 | 北京百度网讯科技有限公司 | Database operation method and device |
| CN110807067A (en) * | 2019-09-29 | 2020-02-18 | 北京淇瑀信息科技有限公司 | Data synchronization method, device and equipment for relational database and data warehouse |
| CN111309750A (en) * | 2020-03-31 | 2020-06-19 | 中国邮政储蓄银行股份有限公司 | Data updating method and device for graph database |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112860953A (en) * | 2021-01-27 | 2021-05-28 | 国家计算机网络与信息安全管理中心 | Data importing method, device, equipment and storage medium of graph database |
| CN113326276A (en) * | 2021-06-23 | 2021-08-31 | 北京金山数字娱乐科技有限公司 | Graph database updating method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111338766B (en) | Transaction processing method and device, computer equipment and storage medium | |
| CN110046029A (en) | Data processing method and device applied to multi-level buffer in cluster | |
| US11947524B2 (en) | Transaction processing method and apparatus, computer device, and storage medium | |
| CN111444027B (en) | Transaction processing method and device, computer equipment and storage medium | |
| CN104572920A (en) | Data arrangement method and data arrangement device | |
| CN109690522B (en) | Data updating method and device based on B+ tree index and storage device | |
| CN112015819A (en) | Data updating method, device, equipment and medium for distributed graph database | |
| US11030175B2 (en) | Blockchain based hierarchical data storage | |
| CN104423982A (en) | Request processing method and device | |
| CA3147376A1 (en) | Data processing method, device, computer equipment and storage medium | |
| CN111522881B (en) | Service data processing method, device, server and storage medium | |
| CN112559529A (en) | Data storage method and device, computer equipment and storage medium | |
| CN114969165B (en) | Data query request processing method, device, equipment and storage medium | |
| CN111753141A (en) | Data management method and related equipment | |
| CN115687359A (en) | Data table partitioning method and device, storage medium and computer equipment | |
| CN115469810A (en) | Data acquisition method, device, equipment and storage medium | |
| CN115544007A (en) | Label preprocessing method and device, computer equipment and storage medium | |
| CN115114289A (en) | Data query method and device and electronic equipment | |
| CN113868138A (en) | Method, system, equipment and storage medium for acquiring test data | |
| JP2013033439A (en) | Database management method | |
| CN115098228B (en) | Transaction processing method and device, computer equipment and storage medium | |
| CN113051274B (en) | Mass tag storage system and method | |
| US20240078221A1 (en) | Systems and methods of modeling and querying dynamic temporal graph on massive parallel graph processing and storage engine | |
| WO2024016789A1 (en) | Log data query method and apparatus, and device and medium | |
| CN117075951A (en) | Program maintenance method, program maintenance device, computer equipment and storage medium |
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 |