Data processing method, device, electronic device and storage medium of graph database

By introducing view data tables into the graph database to maintain the hierarchical relationships between the data to be processed and related data, the problem of low efficiency in the retrieval and recommendation of multimedia content in the graph database is solved, and efficient data processing and consistency maintenance are achieved.

CN113190718BActive Publication Date: 2024-11-26BAIDU ONLINE NETWORK TECH (BEIJIBG) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110469049.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-04-28
Publication Date
2024-11-26
Estimated Expiration
2041-04-28

AI Technical Summary

Technical Problem

Existing technologies struggle to efficiently process the retrieval and recommendation of multimedia content in graph databases, especially in internet information retrieval and recommendation scenarios, where the mining and storage of relationships within multimedia content such as images and videos suffers from inefficiency.

Method used

By introducing view data tables into the graph database, the hierarchical relationship between the data to be processed and related data is maintained, the storage location of the data in the related data table is determined, and corresponding data processing is performed, including add, delete, modify, and query operations, to ensure data consistency and efficiency.

Benefits of technology

It improves the efficiency of multimedia content retrieval and recommendation in graph databases, enhances data processing performance and consistency, and meets the timeliness and synchronization requirements of business needs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113190718B_ABST
    Figure CN113190718B_ABST
Patent Text Reader

Abstract

The present disclosure proposes a data processing method, device, electronic device and storage medium for a graph database, which relates to the field of computer technology, and in particular to the field of artificial intelligence technology such as knowledge graphs and intelligent recommendations. The specific implementation scheme is as follows: determining data to be processed; determining, based on the data to be processed and in combination with a view data table of the graph database, an associated storage position of associated data in an associated data table, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; processing the data to be processed in the data table to be processed, and processing the associated data in the associated data table according to the associated storage position, so as to achieve the use of the view data table to maintain the subordinate relationship between basic data tables, which can effectively improve the processing performance of the graph database and effectively improve the data processing effect of the graph database.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, in particular to the field of artificial intelligence technology such as knowledge graphs and intelligent recommendations, and more particularly to data processing methods, devices, electronic devices and storage media for graph databases. Background Art

[0002] Artificial intelligence is a discipline that studies how to use computers to simulate certain human thought processes and intelligent behaviors (such as learning, reasoning, thinking, planning, etc.). It includes both hardware-level and software-level technologies. Artificial intelligence hardware technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, and big data processing; artificial intelligence software technologies mainly include computer vision technology, speech recognition technology, natural language processing technology, as well as machine learning / deep learning, big data processing technology, knowledge graph technology, and other major directions.

[0003] In today's Internet information retrieval and recommendation scenarios, multimedia content such as pictures and videos accounts for an increasingly large proportion. In order to make these multimedia contents better retrieved and recommended, it is necessary to fully explore the image content, the various image links that appear on the Internet, and a series of related attributes of the web pages where these image links are located and the relationship between them. Summary of the invention

[0004] Provided are a graph database data processing method, device, electronic device, storage medium, and computer program product.

[0005] According to a first aspect, a data processing method of a graph database is provided, comprising: determining data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database; determining an associated storage location of associated data in an associated data table according to the data to be processed and in combination with a view data table of the graph database, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and processing the data to be processed in the data table to be processed, and processing the associated data in the associated data table according to the associated storage location.

[0006] According to a second aspect, a data processing device of a graph database is provided, comprising: a first determination module, used to determine data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database; a second determination module, used to determine an associated storage position of associated data in an associated data table according to the data to be processed in combination with a view data table of the graph database, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed and the table category of the associated data table are different; and a processing module, used to process the data to be processed in the data table to be processed, and process the associated data in the associated data table according to the associated storage position.

[0007] According to a third aspect, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the data processing method of the graph database proposed in an embodiment of the present disclosure.

[0008] According to a fourth aspect, a non-transitory computer-readable storage medium storing computer instructions is proposed, wherein the computer instructions are used to enable the computer to execute the data processing method of the graph database proposed in the embodiment of the present disclosure.

[0009] According to a fifth aspect, a computer program product is proposed, comprising a computer program, which, when executed by a processor, implements the data processing method of the graph database proposed in an embodiment of the present disclosure.

[0010] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.

[0012] Figure 1 is a schematic diagram according to a first embodiment of the present disclosure;

[0013] Figure 2a is a schematic diagram of the structure of a data table to be processed in an embodiment of the present disclosure;

[0014] Figure 2b is a schematic diagram of the structure of a view data table in an embodiment of the present disclosure;

[0015] Figure 3 is a schematic diagram according to a second embodiment of the present disclosure;

[0016] Figure 4 It is a schematic diagram of the affiliation and association relationship between the identification to be processed and the association identification in the embodiment of the present disclosure;

[0017] Figure 5 is a schematic diagram according to a third embodiment of the present disclosure;

[0018] Figure 6a is a schematic diagram of a method for generating a timestamp in an embodiment of the present disclosure;

[0019] Figure 6b is a schematic diagram of the correspondence between the data to be processed and the timestamp in the embodiment of the present disclosure;

[0020] Figure 7a is a flowchart of data maintenance in an embodiment of the present disclosure;

[0021] Figure 7b is a schematic diagram of the timestamp relationship of the F table in the embodiment of the present disclosure;

[0022] Figure 7c is a schematic diagram of the structure of a view data table in an embodiment of the present disclosure;

[0023] Figure 8 It is a schematic diagram of the architecture design of the map database in the embodiment of the present disclosure;

[0024] Fig. 9 is a schematic diagram according to a fourth embodiment of the present disclosure;

[0025] Fig.10 is a schematic diagram according to a fifth embodiment of the present disclosure;

[0026] Fig.11 It is a block diagram of an electronic device used to implement the data processing method of the graph database of the embodiment of the present disclosure. DETAILED DESCRIPTION

[0027] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.

[0028] Figure 1 is a schematic diagram according to the first embodiment of the present disclosure.

[0029] It should be noted that the executor of the data processing method of the graph database of this embodiment is a data processing device of the graph database, which can be implemented by software and / or hardware. The device can be configured in an electronic device, and the electronic device may include but is not limited to a terminal, a server, etc.

[0030] The present disclosure relates to the field of computer technology, and in particular to the field of artificial intelligence technology such as knowledge graphs and intelligent recommendations.

[0031] Among them, Artificial Intelligence (AI) is a new technical science that studies and develops theories, methods, technologies and application systems for simulating, extending and expanding human intelligence.

[0032] Knowledge graph is a modern theory that achieves the purpose of multidisciplinary integration by combining the theories and methods of applied mathematics, graphics, information visualization technology, information science and other disciplines with metrological citation analysis, co-occurrence analysis and other methods, and using visual graphs to vividly display the core structure, development history, frontier fields and overall knowledge architecture of the discipline.

[0033] Intelligent recommendation means providing real-time and accurate recommendation services for different scenarios through in-depth mining of user behavior and business characteristics, thereby quickly improving user activity and click-through conversion rate.

[0034] like Figure 1 As shown, the data processing method of the graph database includes:

[0035] S101: Determine the data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database.

[0036] The embodiments of the present disclosure can be specifically applied in application scenarios where corresponding processing is performed on data in basic data tables. In the embodiments of the present disclosure, the affiliation relationship between the basic data tables is maintained in advance based on a view data table, so as to assist in adding, deleting, modifying and checking the data to be processed stored in the basic data tables based on the affiliation relationship that can be assisted in maintaining by the view data table.

[0037] Among them, the data that currently needs to be processed (processed, such as adding, deleting, modifying, and checking) can be called data to be processed. The data to be processed can be, for example but not limited to, pictures, videos, picture links, video links, or any other possible data, and the data to be processed can be one piece of data or multiple pieces of data, which is not specifically limited here.

[0038] The graph database in the embodiment of the present disclosure is also called a graph database. A graph database is a non-relational database that uses graph theory to store relationship information between entities. A graph database is usually based on graph theory in data structure. There are two core elements that constitute a graph: a vertex (also called a point) and the attributes on the node, and an edge (also called an edge or relationship) and the attributes on the edge.

[0039] The graph database may be, for example but not limited to, a GraphDB graph database, a Neo4j graph database, etc. In the graph database, for example, one or more data tables may be stored, wherein each data table may be used to store the above-mentioned image data and video data, and the data table storing the data to be processed may be referred to as a data table to be processed.

[0040] The data to be processed can be specifically, for example, a picture in a graph database, which can be stored in a table of data to be processed. Accordingly, the table of data to be processed has a table category, which can be determined by the content stored therein. Assuming that the content stored therein is a picture, the table category can be a picture content category, and there is no restriction on this.

[0041] The data to be processed may also be a link to an image, or a link to a web page to which the image belongs, etc., and there is no restriction on this.

[0042] If the data to be processed is a picture, the specific presentation form of the data to be processed can be a picture content signature (hereinafter referred to as "c"), which can be understood as pictures with the same content having the same signature, that is, pictures with different signatures must have different contents.

[0043] If the data to be processed is a picture link, the data to be processed can be represented by "o". The picture link represents the link address corresponding to the picture on the Internet. For example, the picture link is in the form of www.baidu.com / 1.jpg. Different picture links may correspond to the same picture content, that is, multiple picture links can correspond to the same picture.

[0044] If the data to be processed is a web page link, the data to be processed can be represented by "f", which represents the link of the web page to which the image belongs. The same web page may include multiple image links, and one image link may belong to multiple different web pages.

[0045] The above-mentioned pictures, picture links, and web page links can all be called data to be processed. Correspondingly, the pictures, picture links, and web page links can all be stored in corresponding data tables. In the disclosed embodiments, the data table storing the above-mentioned pictures, picture links, and web page links can be called a basic data table, and then support is provided to maintain a view data table based on several basic data tables.

[0046] In some embodiments, different data tables may correspond to different table categories, for example, picture content categories, picture link categories, and web page link categories. The table category of the data table storing pictures may be picture content categories, the table category of the data table storing picture links may be picture link categories, and the table category of the data table storing web page links may be web page link categories. By classifying the data table into picture content categories, picture link categories, and web page link categories, the relationship between the three dimensions of Internet pictures, picture links, and web pages where picture links are located, as well as the attributes of each dimension itself, can be accurately and efficiently expressed. In Internet recommendations, it can assist in more comprehensive retrieval and recommendation of picture content.

[0047] In a specific example, for example, the data to be processed is a picture link, and the data table storing the picture link in the graph database is the data table to be processed (the table category of the data table to be processed, for example, the picture link category).

[0048] In order to clearly describe the present disclosure, the data table to be processed can be represented by "O table", and correspondingly, the data table storing pictures can be represented by "C table", and the data table storing web page links can be represented by "F table".

[0049] In some embodiments, as shown in FIG. 2 , Figure 2a It is a structural diagram of the data table to be processed in the embodiment of the present disclosure, wherein o1, o1c4f4, etc. can be used to represent the pending identification of the data to be processed stored in the data table to be processed, and each pending identification can correspond to a primary key rowkey and corresponding data content and characteristics.

[0050] S102: Determine the associated storage location of the associated data in the associated data table according to the data to be processed and in combination with the view data table of the graph database, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table.

[0051] After the data to be processed is determined as described above, the embodiment of the present disclosure can determine the associated storage location of the associated data in the associated data table based on the data to be processed in combination with the view data table of the graph database.

[0052] Among them, the table aggregated by all or part of the data tables in the graph database can be called a view data table (View Table), which can assist in adding, deleting, modifying and checking the data to be processed stored in the basic data table based on the subordinate relationship that can be assisted in maintaining by the view data table.

[0053] In some embodiments, the view data table is maintained based on the data table to be processed and the associated data table.

[0054] For example, at least part of the contents included in the above-mentioned O table, C table, and F table are aggregated to obtain a view data table.

[0055] In some embodiments, the view data table may be oriented toward the business level, that is, the view data table may be understood as a table for the business party to add, delete, modify, and query.

[0056] In actual applications, each row of data in the view data table can integrate the content required by the business level (for example, the affiliation relationship between pictures, picture links, and web page links, or the storage locations of pictures, picture links, and web page links in the corresponding basic data tables, as well as the corresponding identifiers of pictures, picture links, and web page links, etc., without limitation), thereby assisting the business level to add, delete, modify, and query multiple basic data tables based on the view data table.

[0057] In other embodiments, the view data table may also be formed according to a trigger mechanism.

[0058] For example, querying (eg, scanning) the O table, the C table, or the F table may trigger the formation of a view data table, so that the business layer may construct the view data table at a lower cost.

[0059] The data having a subordinate association relationship with the data to be processed may be referred to as associated data, and the associated data may be one or more pieces of data.

[0060] For example, in combination with the above-mentioned data to be processed being a picture link, the associated data is, for example, a picture or a web page link, or the associated data includes both a picture and a web page link, and the associated data that has a subordinate relationship with the data to be processed indicates: the picture link indicates the aforementioned picture, and the web page link to which the picture link belongs is the aforementioned web page link, and no specific limitation is made here.

[0061] The affiliation relationship may be a description of the affiliation or association relationship between the data to be processed and the associated data.

[0062] For example, if the data to be processed is an image link and the associated data is a web page link, the image link can be located in the web page link, which means that the image link belongs to the web page link. In this case, there can be a subordinate relationship between the data to be processed and the associated data.

[0063] For another example, the data to be processed is a picture link, and the associated data is a picture. There is an association between the picture and the picture link. In this case, the data to be processed and the associated data may be another type of subordinate association relationship.

[0064] In addition, the subordinate association relationship may also describe any other possible relationship between the data to be processed and the associated data, which is not specifically limited here.

[0065] Correspondingly, the data table storing associated data in the graph database can be called an associated data table, and the table category of the data table to be processed is different from the table category of the associated data table. For example, if the associated data table is C table and / or F table, the table category of the associated data table can be a picture content category and / or a web page link category, which is different from the data table to be processed (picture link category).

[0066] The storage location of associated data in the associated data table can be called an associated storage location. Correspondingly, the storage location of the data to be processed in the data table to be processed can be called a data to be processed storage location. The storage location can, for example, be the row and column position occupied by the data in the corresponding data table.

[0067] Optionally, in some embodiments, the view data table includes: a to-be-processed identifier and a to-be-processed storage location of the to-be-processed data, an associated identifier and an associated storage location of the associated data, and the to-be-processed storage location is the storage location of the to-be-processed data in the to-be-processed data table.

[0068] Among them, the data displayed in the view data table has corresponding identifiers, that is, the data in the data table can be indexed by the identifier for storage location in the view data table, and the identifier used to index the data to be processed can be called the pending identifier, and the identifier used to index the associated data can be called the associated identifier. The basic data table can also store specific data content corresponding to the data to be processed and the associated data.

[0069] For example, the identification of the data to be processed may be o1, o2, o3, etc., and the identification of the associated data may be c1, c2, c3, f1, f2, f3, etc. Since the view data table aggregates at least part of the data in the basic data table, the identification of the data to be processed and the associated identification may also be c1o1, c1o1f1, etc., which are not specifically limited here. When the identification of the data to be processed or the associated identification is presented in a combined form, it indicates that the corresponding data to be processed and the associated data have a certain subordinate relationship.

[0070] In addition, the view data table can also record the pending storage location of the pending data and the associated storage location of the associated data, where the pending storage location is the storage location of the pending data in the pending data table. The description of the pending storage location is the same as the description of the associated storage location mentioned above, and will not be repeated here.

[0071] In one specific example, Figure 2b is a schematic diagram of the structure of the view data table in the embodiment of the present disclosure, such as Figure 2b As shown, the shaded part indicates the storage location, c1, c1o1, etc. indicate the identifier, and each row of data also corresponds to a primary key rowkey and a feature feature.

[0072] Therefore, using identifiers to represent the data to be processed and related data can simplify the structure of the view data table, and help the business level quickly understand the affiliation and relationship between data. It can also quickly and accurately assist in locating the corresponding data based on the storage location, which can effectively improve the efficiency of adding, deleting, modifying and checking data.

[0073] Therefore, the embodiment of the present disclosure can determine the associated storage location of the associated data in the associated data table based on the data to be processed in combination with the view data table of the graph database.

[0074] S103: Process the data to be processed in the data table to be processed, and process the associated data in the associated data table according to the associated storage location.

[0075] After determining the associated storage location as described above, the embodiment of the present disclosure may process the data to be processed in the data table to be processed, for example, the data to be processed in the data table to be processed may be added, deleted, updated, etc., which is not specifically limited here.

[0076] In the embodiments of the present disclosure, since the data to be processed and the associated data have a subordinate relationship, after processing the data to be processed in the data table to be processed, the embodiments of the present disclosure can also process the associated data in the associated data table according to the associated storage location. For example, according to the processing of the data to be processed, the associated data in the associated data table is added, deleted, updated, etc. accordingly, thereby ensuring the data consistency of the data to be processed and the associated data, and realizing convenient and efficient consistency maintenance of the data tables in the graph database.

[0077] Optionally, in some embodiments, the data to be processed in the data table to be processed can be processed, and at the same time, the associated data in the associated data table can be processed according to the associated storage location. That is to say, the data to be processed and the associated data are processed synchronously, thereby effectively ensuring the consistency of the data and ensuring the availability and stability of the database itself, thereby meeting the business party's requirements for data synchronization.

[0078] It is understandable that the above examples are only illustrative of processing the data to be processed and the associated data. In practical applications, any other methods may be used for processing, which is not specifically limited here.

[0079] In this embodiment, by determining the data to be processed, wherein the data to be processed is stored in a data table to be processed of a graph database; determining the associated storage position of the associated data in the associated data table according to the data to be processed and in combination with the view data table of the graph database, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and processing the data to be processed in the data table to be processed, and processing the associated data in the associated data table according to the associated storage position, so as to realize the use of the view data table to maintain the subordinate relationship between the basic data tables, which can effectively improve the processing performance of the graph database and effectively improve the data processing effect of the graph database.

[0080] Figure 3 is a schematic diagram according to a second embodiment of the present disclosure.

[0081] like Figure 3 As shown, the data processing method of the graph database includes:

[0082] S301: Determine the data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database.

[0083] The description of S301 can be specifically referred to the above embodiment, which will not be repeated here.

[0084] S302: Determine an associated identifier based on the identifier to be processed and in combination with an index table of a graph database, where the index table stores a subordinate association relationship between the data to be processed and the associated data.

[0085] In some embodiments, the affiliation relationship between the data to be processed and the related data can be stored in an index table, that is, the index table can be used to maintain the affiliation relationship between the data to be processed and the related data, so as to achieve the addition, deletion, modification and query of the data to be processed stored in the basic data table based on the affiliation relationship that can be assisted in maintaining by the view data table, while facilitating the rapid and accurate determination of the related data having affiliation relationship with the data to be processed based on the index table, which can effectively improve the efficiency of maintaining database consistency and ensure the accuracy of maintaining affiliation relationship.

[0086] The affiliation relationship stored in the index table may be, for example, the affiliation relationship between the to-be-processed data and the identifier of the associated data, that is, the index table may store the affiliation relationship between the to-be-processed identifier and the associated identifier.

[0087] like Figure 4 As shown, Figure 4 is a schematic diagram of the affiliation relationship between the identifier to be processed and the associated identifier in the embodiment of the present disclosure. There is a affiliation relationship between c1 and o1, there is a affiliation relationship between o1 and f1, etc. Figure 4 The affiliation relationship in the can be stored using this index table.

[0088] Therefore, in the operation of determining the associated storage location of the associated data in the associated data table based on the data to be processed in combination with the view data table of the graph database, the embodiment of the present disclosure can first determine the associated identifier based on the identifier to be processed in combination with the index table of the graph database, that is: search the index table for the associated identifier that has an affiliation relationship with the identifier to be processed, and then trigger subsequent steps.

[0089] S303: Determine the associated storage location of the associated data in the associated data table according to the associated identifier and in combination with the view data table.

[0090] Furthermore, according to the association identifier, the associated storage location of the associated data in the associated data table is determined in combination with the view data table. Since the index table stores the subordinate relationship between the data to be processed and the associated data, the associated data with the subordinate relationship with the data to be processed can be quickly and accurately determined based on the index table, which can effectively improve the efficiency of maintaining database consistency, ensure the accuracy of maintaining the subordinate relationship, and thus greatly improve the efficiency of graph database processing data.

[0091] It can be understood that the above example is an illustrative description of how to determine the associated storage location, and in practical applications, any other possible manner may be used for determination, which is not specifically limited here.

[0092] S304: Acquire target data to be processed, and determine a target identifier to be processed and / or a target storage location to be processed corresponding to the target data to be processed, wherein the target data to be processed is used to process the data to be processed.

[0093] The target data to be processed is used to process the data to be processed, that is, the data used to process the data to be processed can be called the target data to be processed, for example, the target data to be processed is used to update the data to be processed.

[0094] In some embodiments, for example, when updating a data table of a graph database, the data to be processed may be replaced with the target data to be processed to implement an update operation on the data to be processed.

[0095] The identifier corresponding to the target data to be processed may be referred to as the target identifier to be processed, and the storage location of the target data to be processed in the data table to be processed may be referred to as the target storage location to be processed.

[0096] In order to achieve the above-mentioned purpose, in the embodiments of the present disclosure, target data to be processed may be acquired, and a target identifier to be processed and / or a target storage location to be processed corresponding to the target data to be processed may be determined.

[0097] S305: Acquire associated target data according to the target data to be processed.

[0098] In practical applications, after obtaining the target data to be processed, corresponding associated target data may be generated. For example, when a new picture link (target data to be processed) is generated, a new picture (associated target data) may be generated, and the new picture is the picture indicated by the new picture link.

[0099] That is to say, the embodiments of the present disclosure support directly determining the corresponding associated target data based on the target data to be processed. Since the associated target data is data that has a subordinate association relationship with the target data to be processed, while the target data to be processed is used to update the data to be processed, the associated data can also be updated accordingly in a timely manner.

[0100] S306: Determine an associated target identifier and / or an associated target storage location corresponding to the associated target data, where the associated target data is used to process the associated data.

[0101] Further, an associated target identifier and / or an associated target storage location corresponding to the associated target data is determined, and the associated target data is used to process the associated data.

[0102] The identifier corresponding to the associated target data may be referred to as an associated target identifier, and the storage location of the associated target data in the associated data table may be referred to as an associated target storage location.

[0103] S307: updating the to-be-processed identifier of the to-be-processed data in the to-be-processed data table according to the to-be-processed target identifier, and updating the to-be-processed storage position of the to-be-processed data in the to-be-processed data table according to the to-be-processed target storage position.

[0104] Furthermore, the pending target identifier is used to update the pending identifier of the pending data in the pending data table, and the pending target storage position is used to update the pending storage position of the pending data in the pending data table, thereby achieving the effect of updating the data in the pending data table.

[0105] Optionally, in some embodiments, the to-be-processed identifier in the view data table may be updated according to the to-be-processed target identifier; and the to-be-processed storage location in the view data table may be updated according to the to-be-processed target storage location.

[0106] That is to say, after the pending data in the pending data table is updated, the implementation example of the present disclosure can also update the pending identification and the pending storage location in the view data table, so as to ensure the synchronization of data in the pending data table and the view data table. Therefore, it can effectively ensure the consistency between the view data table and the data table at the business level, ensure the maintenance accuracy of the view data table, and improve the maintenance and integration effect of the view data table.

[0107] S308: updating the association identifier of the associated data in the associated data table according to the association target identifier, and updating the associated storage position of the associated data in the associated data table according to the association target storage position.

[0108] In the disclosed embodiment, the association target identifier may be used to update the association identifier of the associated data in the associated data table, and the association target storage location may be used to update the associated storage location of the associated data in the associated data table, thereby achieving the effect of updating the data in the associated data table.

[0109] Optionally, in some embodiments, the association identifier in the view data table may be updated according to the association target identifier; and the association storage location in the view data table may be updated according to the association target storage location.

[0110] That is to say, after updating the associated data in the associated data table, the implementation example of the present disclosure can also update the associated identifier and the associated storage location in the view data table, thereby ensuring the synchronization of data in the associated data table and the view data table, and can effectively ensure the consistency between the view data table and the data table at the business level, ensure the maintenance accuracy of the view data table, and help the business party view the results of the data update.

[0111] In this embodiment, by determining the data to be processed, wherein the data to be processed is stored in the data table to be processed of the graph database; according to the data to be processed, in combination with the view data table of the graph database, the associated storage position of the associated data in the associated data table is determined, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and the data to be processed in the data table to be processed is processed, and the associated data in the associated data table is processed according to the associated storage position, so as to realize the use of the view data table to maintain the subordinate relationship between the basic data tables, which can effectively improve the processing performance of the graph database and the data processing effect of the graph database. In addition, the target data to be processed and the associated target data can be used to update the data table to be processed and the associated data table, and the view data table can also be updated at the same time as the update, thereby ensuring the synchronization between the data table and the view data table, which is convenient for the business party to view the results of the data update.

[0112] Figure 5 is a schematic diagram according to a third embodiment of the present disclosure.

[0113] like Figure 5 As shown, if the table category of the data table to be processed is a picture link category or a web page link category, the data processing method of the graph database includes:

[0114] S501: Determine the data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database.

[0115] S502: Determine an associated identifier based on the identifier to be processed and in combination with an index table of a graph database, where the index table stores a subordinate association relationship between the data to be processed and the associated data.

[0116] S503: Determine the associated storage location of the associated data in the associated data table according to the associated identifier and in combination with the view data table.

[0117] The description of S501 to S503 can be specifically referred to the above embodiment, which will not be repeated here.

[0118] S504 obtains a to-be-processed timestamp corresponding to the to-be-processed data, wherein the to-be-processed timestamp is a timestamp when the to-be-processed data is crawled.

[0119] In some embodiments, the data to be processed may be, for example, data crawled from the Internet, and a corresponding timestamp may be generated during the crawling process.

[0120] Among them, the timestamp when the data to be processed is crawled can be called the timestamp to be processed. In the embodiment of the present disclosure, the timestamp to be processed is first obtained.

[0121] S505: Obtain an associated timestamp corresponding to the associated data, wherein the associated timestamp is a timestamp when the data to be processed is crawled and the associated data is parsed.

[0122] The data to be processed is crawled, and the data that has a subordinate association relationship with the data to be processed is parsed to obtain the associated data, and the timestamp when the associated data is parsed can be called the associated timestamp.

[0123] For example, if the data to be processed is a web page link f, the timestamp when the data to be processed is crawled from the Internet can be called the timestamp to be processed. Then, after crawling the web page link, the image link o (i.e., associated data) can be parsed from the web page, and the timestamp when the associated data is parsed can be called the associated timestamp.

[0124] like Figure 6a As shown, Figure 6a Schematic diagram of the method of generating a timestamp in an embodiment of the present disclosure. Figure 6a As shown in the figure, for example, f represents the data to be processed, o represents the associated data, fts represents the timestamp when the data to be processed f is captured, and fots represents the timestamp when the data to be processed f is captured and the associated data o is parsed. By introducing the timestamps of the o vertex, oc edge, of edge, and f vertex when the data is produced as auxiliary data, the maintenance logic of the view database is more direct, the effectiveness is simpler, and the software and hardware costs of data maintenance can be effectively reduced.

[0125] also, Figure 6b is a schematic diagram of the corresponding relationship between the data to be processed and the timestamp in the embodiment of the present disclosure, such as Figure 6b As shown, for example, the timestamp of f1 is ts2, the timestamp of f1o1 is ts1, and so on.

[0126] S506: Dynamically update the view data table and the index table according to the to-be-processed timestamp and the associated timestamp.

[0127] After obtaining the timestamp to be processed and the associated timestamp, the embodiment of the present disclosure can dynamically update the view data table and the index table according to the timestamp to be processed and the associated timestamp. Thus, the view data table and the index table can be updated according to the timestamp, ensuring the timeliness of the data in the view data table, thereby meeting the business party's demand for data timeliness.

[0128] In some embodiments, if the to-be-processed timestamp is greater than the associated timestamp, the associated identifier and the associated storage location in the view data table are deleted, and the subordinate association relationship in the index table is deleted.

[0129] For example, combining Figure 6b As shown, for example, if the FTS timestamp ts2 (timestamp to be processed) of f1 (data to be processed) is greater than the FTS timestamp ts1 (associated timestamp) of f1o1, f1o2, f1o3 (associated data), then f1o1, f1o2, f1o3 are expired data, so the associated identifiers and associated storage locations in the view data table can be deleted, that is, the corresponding associated identifiers and associated storage locations of f1o1, f1o2, f1o3 in the view data table are deleted, and the subordinate association relationship in the index table is deleted.

[0130] If the to-be-processed timestamp is equal to the associated timestamp, the step of obtaining the to-be-processed timestamp corresponding to the to-be-processed data is re-executed.

[0131] For example, combining Figure 6b As shown, when the FTS timestamp ts2 of f1 is equal to the FTS timestamp ts2 (associated timestamp) of f1o4, f1o5, and f1o6 (associated data), then part of the data of f1o4, f1o5, and f1o6 is the latest data. In this case, the step of obtaining the to-be-processed timestamp corresponding to the to-be-processed data can be re-executed. Thus, by comparing the timestamps to determine the order in which the data is generated, it is possible to quickly determine the invalid data and clear it, effectively reducing the data storage volume of the view data table and the index table, thereby helping to improve the processing efficiency of the database.

[0132] In this embodiment, by determining the data to be processed, wherein the data to be processed is stored in the data table to be processed of the graph database; according to the data to be processed, the associated storage position of the associated data in the associated data table is determined in combination with the view data table of the graph database, wherein the view data table is obtained by maintaining the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and the data to be processed in the data table to be processed is processed, and the associated data in the associated data table is processed according to the associated storage position, so as to realize the use of the view data table to maintain the subordinate relationship between the basic data tables, which can effectively improve the processing performance of the graph database and the data processing effect of the graph database. In addition, the view data table and the index table can be updated according to the timestamp, which ensures the timeliness of the data in the view data table, thereby meeting the business party's demand for data timeliness. Moreover, by comparing the timestamps to determine the order in which the data is generated, it can assist in quickly determining invalid data and clearing it, effectively reducing the data storage volume of the view data table and the index table, thereby assisting in improving the processing efficiency of the database.

[0133] The application of the embodiments of the present disclosure can be illustrated as follows: Figure 7a As shown, Figure 7a : is a flowchart of data maintenance in an embodiment of the present disclosure, and maintaining data includes the following steps:

[0134] 1. Use a trigger mechanism to query the data table, such as querying (Scan) the F table.

[0135] 2. The F table data ring division method adopts the prefix hash value Hash to ensure that the data of the same web page (f1) is in the same shard, and all the data of f1 is together, which can easily obtain all the data of f1.

[0136] like Figure 7b As shown, Figure 7b It is a schematic diagram of the timestamp relationship of the F table in the embodiment of the present disclosure. The timestamp ts2>ts1, indicating that rows 5-7 of the F table are the latest data; rows 2-4 are the data to be updated (deleted).

[0137] 3. Update the view data table.

[0138] like Figure 7c As shown, Figure 7c It is a schematic diagram of the structure of the view data table in the embodiment of the present disclosure. The view data table is aggregated by f (it can also be aggregated by c). The index table can be used to quickly locate the location of the data to be deleted in the view data table. f1o1c1, f1o2c2, and f1o3c3 need to be deleted synchronously in the view data table.

[0139] 4. Update the index table.

[0140] 5. Update table F. After the above process is completed, update the data in table F and delete rows 2-4 in table F.

[0141] In some embodiments, the update mode (ConsistencyModel) of the view data table can have two modes: synchronous mode and asynchronous mode. In the synchronous mode, the view data table and the basic data table (O table, C table, F table can all be called basic data tables) are updated synchronously; in the asynchronous mode, data updates are completed asynchronously through the background.

[0142] In some embodiments, a synchronous write Write + asynchronous routine query Scan method may be adopted to effectively ensure the availability and stability of the database itself.

[0143] When a change operation is completed, the consistency of the entire database is ultimately guaranteed through the maintenance of the view data table. If multiple update operations occur at the same time, the order of writing is guaranteed by the timestamp of the data, ensuring that the latest data (with the latest timestamp) takes effect.

[0144] like Figure 8 As shown, Figure 8 Schematic diagram of the architecture design of the map database in the embodiment of the present disclosure, the architecture includes:

[0145] 8.1 Data storage layer: The actual physical data storage layer for all data, such as but not limited to using a column storage database as the underlying data storage.

[0146] 8.2 DBAPI: Application Programming Interface (API) and Software Development Kit (SDK) tool layer provided by the underlying database. The graph database disclosed in this disclosure uses the above API to perform relevant operations on the data in the data storage layer.

[0147] 8.3 Content Engine Layer: Provides abstraction of business data and implementation of graph database operations. Externally, business parties can view information on business dimensions and perform graph operations, which enables encapsulation of business data to underlying media storage. The engine layer supports graph operations through functions such as views.

[0148] 8.4 Trigger mechanism: It provides a distributed way to process data. It can rely on the distributed infrastructure system HadoopMR (Hadoop Map / Reduce) to traverse the data by querying Scan to determine which data records need to trigger subsequent logic. For example, the logic triggered by the query Scan can be determined by the characteristics of the business itself.

[0149] The trigger mechanism implements the following functions in the entire system:

[0150] 1) The triggered throughput can be automatically controlled according to the overall load of the system;

[0151] 2) Ensure that any record will be processed in a trigger round and will only be triggered once. The trigger execution of each shard is independent of each other and there is no dependency. The predictability of data ringing is guaranteed through the rules of ringing. The same data will only appear in one ring during the entire data life cycle.

[0152] 8.5 Feature Service FeatureService: Real-time access service for content relationship data, meeting users' real-time CRUD functions on the database. It is used to support the read and write access requirements of real-time data streams to the content relationship database. It provides a graph database access interface to the outside world.

[0153] Fig. 9 is a schematic diagram according to a fourth embodiment of the present disclosure.

[0154] like Fig. 9As shown, the data processing device 90 of the graph database includes:

[0155] A first determination module 901 is used to determine the data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database;

[0156] A second determination module 902 is used to determine the associated storage location of the associated data in the associated data table according to the data to be processed and in combination with the view data table of the graph database, wherein the view data table is maintained according to the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and

[0157] The processing module 903 is used to process the to-be-processed data in the to-be-processed data table, and to process the associated data in the associated data table according to the associated storage location.

[0158] Optionally, in some embodiments of the present disclosure, the view data table includes: a to-be-processed identifier of the to-be-processed data, a to-be-processed storage location, an associated identifier of the associated data, and an associated storage location, where the to-be-processed storage location is the storage location of the to-be-processed data in the to-be-processed data table.

[0159] Optionally, in some embodiments of the present disclosure, Fig.10 As shown, Fig.10 1 is a schematic diagram according to the fifth embodiment of the present disclosure. The data processing device 100 of the graph database includes: a first determination module 1001, a second determination module 1002 and a processing module 1003, wherein the second determination module 1002 includes:

[0160] The first determination submodule 1002a is used to determine the association identifier according to the identifier to be processed and in combination with the index table of the graph database, where the index table stores the affiliation relationship between the data to be processed and the associated data;

[0161] The second determining submodule 1002b is used to determine the associated storage position of the associated data in the associated data table according to the associated identifier and in combination with the view data table.

[0162] Optionally, in some embodiments of the present disclosure, Fig.10 As shown, the data processing device 100 of the graph database further includes:

[0163] The first acquisition module 1004 is used to acquire the target data to be processed, and determine the target identifier to be processed and / or the target storage location to be processed corresponding to the target data to be processed, wherein the target data to be processed is used to process the data to be processed;

[0164] The second acquisition module 1005 is used to acquire associated target data according to the target data to be processed;

[0165] A third determination module 1006, for determining an associated target identifier and / or an associated target storage location corresponding to associated target data, the associated target data being used to process the associated data;

[0166] The processing module 1003 includes:

[0167] The first updating submodule 1003a is used to update the to-be-processed identification of the to-be-processed data in the to-be-processed data table according to the to-be-processed target identification, and to update the to-be-processed storage position of the to-be-processed data in the to-be-processed data table according to the to-be-processed target storage position;

[0168] The second updating submodule 1003b is used to update the association identifier of the associated data in the associated data table according to the association target identifier, and to update the associated storage position of the associated data in the associated data table according to the association target storage position.

[0169] Optionally, in some embodiments of the present disclosure, Fig.10 As shown, the processing module 1003 further includes:

[0170] The third updating submodule 1003c is used to update the to-be-processed identifier in the view data table according to the to-be-processed target identifier;

[0171] The fourth updating submodule 1003d is used to update the storage location to be processed in the view data table according to the target storage location to be processed.

[0172] Optionally, in some embodiments of the present disclosure, Fig.10 As shown, the processing module 1003 further includes:

[0173] The fifth updating submodule 1003e is used to update the association identifier in the view data table according to the association target identifier;

[0174] The sixth updating submodule 1003f is used to update the associated storage location in the view data table according to the associated target storage location.

[0175] Optionally, in some embodiments of the present disclosure, the processing module 1003 is specifically used to: process the to-be-processed data in the to-be-processed data table, and process the associated data in the associated data table according to the associated storage location.

[0176] Optionally, in some embodiments of the present disclosure, the table categories of the to-be-processed data table and the associated data table are respectively any one of the following categories: picture content category, picture link category, and web page link category.

[0177] Optionally, in some embodiments of the present disclosure, Fig.10 As shown, the device 100 also includes:

[0178] The third acquisition module 1007 is used to obtain a to-be-processed timestamp corresponding to the to-be-processed data, wherein the to-be-processed timestamp is a timestamp when the to-be-processed data is crawled;

[0179] The fourth acquisition module 1008 is used to acquire an associated timestamp corresponding to the associated data, wherein the associated timestamp is a timestamp when the data to be processed is crawled and the associated data is parsed;

[0180] The updating module 1009 is used to dynamically update the view data table and the index table according to the time stamp to be processed and the associated time stamp.

[0181] Optionally, in some embodiments of the present disclosure, the update module 1009 is specifically configured to:

[0182] If the time stamp to be processed is greater than the associated time stamp, the associated identifier and the associated storage location in the view data table are deleted, and the subordinate relationship in the index table is deleted;

[0183] If the to-be-processed timestamp is equal to the associated timestamp, the step of obtaining the to-be-processed timestamp corresponding to the to-be-processed data is re-executed.

[0184] It is understandable that the present embodiment Fig.10 The data processing device 100 of the graph database in the embodiment and the data processing device 90 of the graph database in the above embodiment, the first determination module 1001 and the first determination module 901 in the above embodiment, the second determination module 1002 and the second determination module 902 in the above embodiment, and the processing module 1003 and the processing module 903 in the above embodiment may have the same function and structure.

[0185] It should be noted that the aforementioned explanation of the data processing method of the graph database is also applicable to the data processing device of the graph database of this embodiment and will not be repeated here.

[0186] In this embodiment, by determining the data to be processed, wherein the data to be processed is stored in a data table to be processed of a graph database; determining the associated storage position of the associated data in the associated data table according to the data to be processed and in combination with the view data table of the graph database, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and processing the data to be processed in the data table to be processed, and processing the associated data in the associated data table according to the associated storage position, so as to realize the use of the view data table to maintain the subordinate relationship between the basic data tables, which can effectively improve the processing performance of the graph database and effectively improve the data processing effect of the graph database.

[0187] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

[0188] Fig.11 It is a block diagram of an electronic device for implementing the data processing method of the graph database of an embodiment of the present disclosure. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0189] like Fig.11 As shown, the device 1100 includes a computing unit 1101, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 1102 or a computer program loaded from a storage unit 1108 into a random access memory (RAM) 1103. In the RAM 1103, various programs and data required for the operation of the device 1100 can also be stored. The computing unit 1101, the ROM 1102, and the RAM 1103 are connected to each other via a bus 1104. An input / output (I / O) interface 1105 is also connected to the bus 1104.

[0190] A number of components in the device 1100 are connected to the I / O interface 1105, including: an input unit 1106, such as a keyboard, a mouse, etc.; an output unit 1107, such as various types of displays, speakers, etc.; a storage unit 1108, such as a disk, an optical disk, etc.; and a communication unit 1109, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 1109 allows the device 1100 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0191] The computing unit 1101 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 1101 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 1101 performs the various methods and processes described above, for example, a data processing method for a graph database.

[0192] For example, in some embodiments, the data processing method of the graph database may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 1108. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 1100 via the ROM 1102 and / or the communication unit 1109. When the computer program is loaded into the RAM 1103 and executed by the computing unit 1101, one or more steps of the data processing method of the graph database described above may be performed. Alternatively, in other embodiments, the computing unit 1101 may be configured to execute the data processing method of the graph database in any other appropriate manner (e.g., by means of firmware).

[0193] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0194] The program code for implementing the data processing method of the graph database disclosed in the present invention can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable graph database data processing device, so that when the program code is executed by the processor or controller, the functions / operations specified in the flow chart and / or block diagram are implemented. The program code can be executed entirely on the machine, partially on the machine, partially on the machine as an independent software package and partially on a remote machine, or entirely on a remote machine or server.

[0195] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0196] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0197] The systems and techniques described herein can be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), the Internet, and a blockchain network.

[0198] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship between the client and the server is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services ("Virtual Private Server", or "VPS" for short). The server may also be a server of a distributed system, or a server combined with a blockchain.

[0199] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this application can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution disclosed in this disclosure can be achieved, and this document is not limited here.

[0200] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A data processing method for a graph database, comprising: Determine the data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database; the data to be processed includes pictures, videos, picture links, and video links; Determining, according to the data to be processed and in combination with the view data table of the graph database, the associated storage location of the associated data in the associated data table, wherein the view data table is maintained according to the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and The data to be processed in the to-be-processed data table is processed, and the associated data in the associated data table is processed according to the associated storage location, wherein the processing operations include adding, deleting, modifying and checking.

2. The method according to claim 1, wherein: The view data table includes: a to-be-processed identifier and a to-be-processed storage location of the to-be-processed data, an associated identifier of the associated data, and the associated storage location, wherein the to-be-processed storage location is a storage location of the to-be-processed data in the to-be-processed data table.

3. The method according to claim 2, wherein: The determining, based on the data to be processed and in combination with the view data table of the graph database, the associated storage location of the associated data in the associated data table includes: Determine the association identifier according to the identifier to be processed and in combination with an index table of the graph database, wherein the index table stores a subordinate association relationship between the data to be processed and the associated data; According to the association identifier, in combination with the view data table, the associated storage location of the associated data in the associated data table is determined.

4. The method according to claim 2, further comprising: Acquire target data to be processed, and determine a target identifier to be processed and / or a target storage location to be processed corresponding to the target data to be processed, wherein the target data to be processed is used to process the data to be processed; According to the target data to be processed, obtaining associated target data; determining an associated target identifier and / or an associated target storage location corresponding to the associated target data, the associated target data being used to process the associated data; The processing of the data to be processed in the table of data to be processed and the processing of the associated data in the associated data table according to the associated storage location include: Update the to-be-processed identifier of the to-be-processed data in the to-be-processed data table according to the to-be-processed target identifier, and update the to-be-processed storage position of the to-be-processed data in the to-be-processed data table according to the to-be-processed target storage position; The association identifier of the associated data in the associated data table is updated according to the associated target identifier, and the associated storage position of the associated data in the associated data table is updated according to the associated target storage position.

5. The method according to claim 4, after processing the data to be processed in the table of data to be processed, further comprising: updating the to-be-processed identifier in the view data table according to the to-be-processed target identifier; The storage location to be processed in the view data table is updated according to the target storage location to be processed.

6. The method according to claim 4, after processing the associated data in the associated data table according to the associated storage location, further comprising: updating the association identifier in the view data table according to the association target identifier; The associated storage location in the view data table is updated according to the associated target storage location.

7. The method according to claim 1, wherein: The processing of the to-be-processed data in the to-be-processed data table and the processing of the associated data in the associated data table according to the associated storage location include: The data to be processed in the table of data to be processed is processed, and at the same time, the associated data in the associated data table is processed according to the associated storage location.

8. The method according to claim 3, wherein: The table categories of the to-be-processed data table and the associated data table are any one of the following categories: Image content categories, image link categories, and web link categories.

9. The method according to claim 8, if the table category of the to-be-processed data table is a picture link category or a web page link category, the method further comprises: Obtaining a to-be-processed timestamp corresponding to the to-be-processed data, wherein the to-be-processed timestamp is a timestamp when the to-be-processed data is crawled; Obtaining an associated timestamp corresponding to the associated data, wherein the associated timestamp is a timestamp when the data to be processed is crawled and the associated data is parsed; The view data table and the index table are dynamically updated according to the to-be-processed timestamp and the associated timestamp.

10. The method according to claim 9, wherein: The dynamically updating the view data table and the index table according to the to-be-processed timestamp and the associated timestamp includes: If the to-be-processed timestamp is greater than the associated timestamp, the associated identifier and the associated storage location in the view data table are deleted, and the subordinate association relationship in the index table is deleted; If the to-be-processed timestamp is equal to the associated timestamp, the step of obtaining the to-be-processed timestamp corresponding to the to-be-processed data is re-executed.

11. A data processing device for a graph database, comprising: A first determination module is used to determine the data to be processed, wherein the data to be processed is stored in a data table to be processed of the graph database; the data to be processed includes pictures, videos, picture links, and video links; a second determination module, configured to determine, based on the data to be processed and in combination with a view data table of the graph database, an associated storage location of the associated data in the associated data table, wherein the view data table is maintained based on the data table to be processed and the associated data table, the data to be processed and the associated data have a subordinate relationship, and the table category of the data table to be processed is different from the table category of the associated data table; and The processing module is used to process the data to be processed in the data table to be processed, and to process the associated data in the associated data table according to the associated storage location, wherein the processing operations include adding, deleting, modifying and checking.

12. The device according to claim 11, wherein The view data table includes: a to-be-processed identifier and a to-be-processed storage location of the to-be-processed data, an associated identifier of the associated data, and the associated storage location, wherein the to-be-processed storage location is a storage location of the to-be-processed data in the to-be-processed data table.

13. The device according to claim 12, wherein: The second determining module includes: A first determination submodule is used to determine the association identifier according to the to-be-processed identifier in combination with an index table of the graph database, wherein the index table stores a subordinate association relationship between the to-be-processed data and the associated data; The second determining submodule is used to determine the associated storage position of the associated data in the associated data table according to the associated identifier and in combination with the view data table.

14. The apparatus according to claim 12, further comprising: A first acquisition module is used to acquire target data to be processed, and determine a target identifier to be processed and / or a target storage location to be processed corresponding to the target data to be processed, wherein the target data to be processed is used to process the data to be processed; A second acquisition module, used to acquire associated target data according to the target data to be processed; a third determination module, configured to determine an associated target identifier and / or an associated target storage location corresponding to the associated target data, wherein the associated target data is used to process the associated data; Wherein, the processing module includes: A first updating submodule is used to update the to-be-processed identification of the to-be-processed data in the to-be-processed data table according to the to-be-processed target identification, and to update the to-be-processed storage position of the to-be-processed data in the to-be-processed data table according to the to-be-processed target storage position; The second updating submodule is used to update the association identifier of the associated data in the associated data table according to the associated target identifier, and update the associated storage position of the associated data in the associated data table according to the associated target storage position.

15. The apparatus according to claim 14, wherein the processing module further comprises: A third updating submodule, configured to update the to-be-processed identifier in the view data table according to the to-be-processed target identifier; A fourth updating submodule is used to update the storage location to be processed in the view data table according to the target storage location to be processed.

16. The apparatus according to claim 14, wherein the processing module further comprises: A fifth updating submodule, configured to update the association identifier in the view data table according to the association target identifier; The sixth updating submodule is used to update the associated storage location in the view data table according to the associated target storage location.

17. The device according to claim 11, wherein: The processing module is specifically used for: The data to be processed in the table of data to be processed is processed, and at the same time, the associated data in the associated data table is processed according to the associated storage location.

18. The device according to claim 13, wherein: The table categories of the to-be-processed data table and the associated data table are any one of the following categories: Image content categories, image link categories, and web link categories.

19. The device according to claim 18, wherein: The device also includes: A third acquisition module is used to acquire a to-be-processed timestamp corresponding to the to-be-processed data, wherein the to-be-processed timestamp is a timestamp when the to-be-processed data is crawled; A fourth acquisition module is used to acquire an associated timestamp corresponding to the associated data, wherein the associated timestamp is a timestamp when the data to be processed is crawled and the associated data is parsed; An updating module is used to dynamically update the view data table and the index table according to the to-be-processed timestamp and the associated timestamp.

20. The device according to claim 19, wherein The update module is specifically used for: If the to-be-processed timestamp is greater than the associated timestamp, the associated identifier and the associated storage location in the view data table are deleted, and the subordinate association relationship in the index table is deleted; If the to-be-processed timestamp is equal to the associated timestamp, the step of obtaining the to-be-processed timestamp corresponding to the to-be-processed data is re-executed.

21. An electronic device comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 10.

22. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-10.

23. A computer program product comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 10.