CN113536047A - Graph database data deleting method, system, electronic equipment and storage medium - Google Patents
Graph database data deleting method, system, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113536047A CN113536047A CN202110721290.9A CN202110721290A CN113536047A CN 113536047 A CN113536047 A CN 113536047A CN 202110721290 A CN202110721290 A CN 202110721290A CN 113536047 A CN113536047 A CN 113536047A
- Authority
- CN
- China
- Prior art keywords
- data
- graph
- deleting
- database
- column
- 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
- 238000000034 method Methods 0.000 title claims abstract description 48
- 230000001360 synchronised effect Effects 0.000 claims abstract description 6
- 238000012217 deletion Methods 0.000 claims description 51
- 230000037430 deletion Effects 0.000 claims description 51
- 238000004590 computer program Methods 0.000 claims description 11
- 230000008569 process Effects 0.000 description 13
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 238000000547 structure data Methods 0.000 description 4
- 238000009825 accumulation Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000000638 solvent extraction Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
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/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method, a system, electronic equipment and a storage medium for deleting data of a graph database, wherein the technical scheme of the method comprises a graph data formatting step, wherein graph data in a graph database is formatted into a database table, and the database table is synchronized into a column-type database management system capable of performing online analysis; a data query and splicing step, namely using a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splicing key values stored in the storage engine by querying the graph data stored in the column database management system; and deleting the graph data, namely deleting the graph database according to the key value. The method and the device solve the problem that the existing graph database data deleting method is low in efficiency when a large amount of graph data are deleted.
Description
Technical Field
The invention belongs to the technical field of databases, and particularly relates to a method and a system for deleting data of a graph database, electronic equipment and a storage medium.
Background
In recent years, with the rapid development of the internet and social networks, large-scale graph structure data, such as graph structure data into which information such as a knowledge graph, a social network, and the like is abstracted, has been increasing. Compared with a traditional big data processing system, the graph system can better utilize the structure information of the graph and process the graph data more efficiently. With the increase of graph structure data, how to efficiently process a large amount of graph structure data becomes a hot point of research. It is also the key point of graph databases to better meet business scenarios and performance requirements by using underlying storage characteristics.
RocksDB is an embedded kv storage engine written in C + +, with keys that all allow the use of binary streams, using an LSM storage engine. ClickHouse is a columnar database management system (DBMS) for online analysis (OLAP). Because the rocksDB is an LSM-Tree storage engine, when a large amount of data is deleted and a compact is not performed, the data query performance is low due to a large number of deleted gravels, and when a large amount of graph data is deleted, the IDs of points or edges needing to be deleted in a library are queried to perform KEY deletion, so that the whole process is slower and slower due to the low query performance.
Disclosure of Invention
The embodiment of the application provides a method, a system, electronic equipment and a storage medium for deleting data of a graph database, so as to at least solve the problem of low efficiency when the existing method for deleting data of the graph database is used for deleting a large amount of data of the graph.
In a first aspect, an embodiment of the present application provides a method for deleting data from a graph database, including: a step of graph data formatting, in which graph data in a graph database is formatted into a database table, and the database table is synchronized into a column type database management system capable of performing online analysis; a data query and splicing step, namely using a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splicing key values stored in the storage engine by querying the graph data stored in the column database management system; and deleting the graph data, namely deleting the graph database according to the key value.
Preferably, the graph data deleting step further includes: and if the whole tag is taken as a deleting object, the graph database suspends receiving service in the graph, and after the data is deleted, the column family storing the data in the storage engine is merged.
Preferably, the graph data deleting step further includes: and after the graph data in the storage engine is deleted, deleting the table in the column database management system to realize data consistency.
Preferably, the graph data deleting step further includes: and if data in a label is taken as a deleting object, deleting operation is carried out through logical deletion, and after the data is deleted, merging operation is carried out on the column group storing the data in the storage engine according to a preset period.
In a second aspect, an embodiment of the present application provides a system for deleting data from a graph database, which is suitable for the method for deleting data from a graph database, and includes: the graph data formatting module is used for formatting graph data in a graph database into a database table and synchronizing the database table into a column type database management system capable of performing online analysis; the data query and splicing module uses a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splices the key values stored in the storage engine by querying the graph data stored in the column-type database management system; and the graph data deleting module is used for deleting the graph database according to the key value.
In some embodiments, the graph data deletion module further comprises: and if the whole tag is taken as a deleting object, the graph database suspends receiving service in the graph, and after the data is deleted, the column family storing the data in the storage engine is merged.
In some embodiments, the graph data deletion module further comprises: and after the graph data in the storage engine is deleted, deleting the table in the column database management system to realize data consistency.
In some embodiments, the graph data deletion module further comprises: and if data in a label is taken as a deleting object, deleting operation is carried out through logical deletion, and after the data is deleted, merging operation is carried out on the column group storing the data in the storage engine according to a preset period.
In a third aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor executes the computer program to implement a method for deleting data from a database as described in the first aspect.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium, on which a computer program is stored, which when executed by a processor, implements a method for deleting data from a graph database as described in the first aspect above.
The method and the device can be applied to the technical field of data capacity. Compared with the prior art, the graph database data deleting method provided by the embodiment of the application can be suitable for the side deleting and side searching scene with LSM-Tree as the bottom storage by utilizing the characteristics of the bottom storage, and can avoid the problem of low deleting efficiency influenced by the query efficiency by combining with a large OLAP engine similar to ClickHouse and ensuring the data consistency. The efficiency problem when a large amount of image data are deleted is solved, data query is carried out while deletion is avoided as much as possible, and the deletion efficiency is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a flow chart of a method for deleting data from a graph database according to the present invention;
FIG. 2 is a block diagram of a system for deleting data from a graph database according to the present invention;
FIG. 3 is a block diagram of an electronic device of the present invention;
in the above figures:
1. a graph data formatting module; 2. a data query and splicing module; 3. a graph data deletion module; 60. a bus; 61. a processor; 62. a memory; 63. a communication interface.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described and illustrated below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments provided in the present application without any inventive step are within the scope of protection of the present application.
It is obvious that the drawings in the following description are only examples or embodiments of the present application, and that it is also possible for a person skilled in the art to apply the present application to other similar contexts on the basis of these drawings without inventive effort. Moreover, it should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another.
Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the specification. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of ordinary skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments without conflict.
Unless defined otherwise, technical or scientific terms referred to herein shall have the ordinary meaning as understood by those of ordinary skill in the art to which this application belongs. Reference to "a," "an," "the," and similar words throughout this application are not to be construed as limiting in number, and may refer to the singular or the plural. The present application is directed to the use of the terms "including," "comprising," "having," and any variations thereof, which are intended to cover non-exclusive inclusions; for example, a process, method, system, article, or apparatus that comprises a list of steps or modules (elements) is not limited to the listed steps or elements, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In the embodiment of the present application, a heterogeneous database NEST is taken as an example, where the NEST includes four storage components, which are a component for graph storage, a component for inverted index storage, a component for OLAP storage, and a component for historical version storage, and by combining the four storage components, the NEST can implement functions such as graph inference, search, OLAP query, historical version change record, and query, and it should be noted that data stored in the NEST all have a unique primary key.
Embodiments of the invention are described in detail below with reference to the accompanying drawings:
FIG. 1 is a flow chart of a method for deleting data from a graph database according to the present invention, and referring to FIG. 1, the method for deleting data from a graph database according to the present invention comprises the following steps:
s1: the method comprises the steps of formatting graph data in a graph database into a database table, and synchronizing the database table into a column type database management system capable of performing online analysis.
In specific implementation, the columnar database management system is a ClickHouse, based on the ClickHouse database, because of the new characteristic of the NEST, the plot expansion is performed while OLAP (online analysis and processing) operation is also required to be performed on the plot data, so the NEST uses the ClickHouse as an OLAP data engine, the plot data is formatted into a form of a database table and is synchronized into the ClickHouse, and the ClickHouse can meet the performance requirement of the NEST when a large amount of data is queried.
In a specific implementation, the storage logic structure of the graph data of the NEST in the RocksDB is as follows:
the dot Vertex Table logical structure is as follows:
the Edge Table logical structure is as follows:
in a specific implementation, the ID of vertex in NEST is designed as the primary key (primaryKey) _ label of the point (vertexLabel).
S2: and using a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splicing key values stored in the storage engine by inquiring the graph data stored in the column database management system.
S3: and deleting the graph database according to the key value.
In a specific implementation, RocksDB is used as the storage engine.
In specific implementation, if graph data (namely, data of points and edges) needs to be deleted, keys stored in a RocksDB can be quickly spliced by inquiring information such as the graph data (a main key of a point, a main object of an edge and a direction) stored in a clickwouse, namely, the keys of the points or the edges can be deleted when the data of the whole label is deleted, the data under the label does not need to be read in the RocksDB while the deletion is carried out, and the problem that a large number of deletion tombstones influence query performance due to the deletion so as to influence the whole deletion process can be improved.
Optionally, if the whole tag is used as a deletion object, the graph database suspends receiving services in the graph, and performs a merge operation on the column family storing data in the storage engine after deleting data. Optionally, after the graph data in the storage engine is deleted, the data consistency is realized by deleting the table in the column database management system.
In a specific implementation, if the whole label is used to delete a data set, this operation only occurs when the schema needs to be modified, and the logic of NEST is that all operations that modify the schema need an issuing process, and in the whole issuing process, the function of the data part of the graph is to suspend receiving services, which also avoids data query when deleting. However, after the deletion is completed, the large number of deleted tombstones does not disappear, and in the specific implementation, the LSM-Tree structure can merge the data files through the composition operation and remove the deleted data, so that after each deletion, the column family of the columns storing the data in the RocksDB needs to be manually subjected to the composition, and after the composition is completed, the tombstone disappears, and the query function returns to normal.
In specific implementation, after the graph data in the RocksDB is deleted, the final data consistency can be realized by directly deleting the whole table in the clickwouse. And the whole release process is finished, and all the NEST functions are recovered.
Optionally, if data in a tag is used as a deletion object, a deletion operation is performed through logical deletion, and after the data is deleted, a merging operation is performed on the column family storing the data in the storage engine according to a preset period.
In a specific implementation, if only a certain piece of data under a certain label is deleted, at this time, in order to ensure consistency of the data, it is necessary to synchronize the deletion operation to the ClickHouse, that is, delete the piece of data in the ClickHouse, but the ClickHouse is not friendly to support frequent deletion operations, so that logical deletion, that is, marking deletion, can be used to mark whether the piece of data is deleted through a field, and then partitioning is performed through the field to speed up real physical deletion at regular time.
In the specific implementation, if the deletion operation of the small batch is continuous, a large number of deletion tombstones are generated in the RocksDB after a period of time accumulation, which affects the query operation, and the influence of the large number of deletion tombstones on the query is avoided by performing the compact operation regularly, and optionally, the timing frequency can be determined according to the frequency and the number of the deletion.
It should be noted that the steps illustrated in the above-described flow diagrams or in the flow diagrams of the figures may be performed in a computer system, such as a set of computer-executable instructions, and that, although a logical order is illustrated in the flow diagrams, in some cases, the steps illustrated or described may be performed in an order different than here.
The embodiment of the application provides a graph database data deleting system, which is suitable for the graph database data deleting method. As used below, the terms "unit," "module," and the like may implement a combination of software and/or hardware of predetermined functions. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware or a combination of software and hardware is also possible and contemplated.
FIG. 2 is a block diagram of a system for deleting data from a graph database according to the present invention, referring to FIG. 2, including:
graph data formatting module 1: the method comprises the steps of formatting graph data in a graph database into a database table, and synchronizing the database table into a column type database management system capable of performing online analysis.
In specific implementation, the columnar database management system is a ClickHouse, based on the ClickHouse database, because of the new characteristic of the NEST, the plot expansion is performed while OLAP (online analysis and processing) operation is also required to be performed on the plot data, so the NEST uses the ClickHouse as an OLAP data engine, the plot data is formatted into a form of a database table and is synchronized into the ClickHouse, and the ClickHouse can meet the performance requirement of the NEST when a large amount of data is queried.
In a specific implementation, the storage logic structure of the graph data of the NEST in the RocksDB is as follows:
the dot Vertex Table logical structure is as follows:
the Edge Table logical structure is as follows:
in a specific implementation, the ID of vertex in NEST is designed as the primary key (primaryKey) _ of the point label (vertexLabel).
The data query splicing module 2: and using a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splicing key values stored in the storage engine by inquiring the graph data stored in the column database management system.
The graph data deletion module 3: and deleting the graph database according to the key value.
In a specific implementation, RocksDB is used as the storage engine.
In specific implementation, if graph data (namely, data of points and edges) needs to be deleted, keys stored in a RocksDB can be quickly spliced by inquiring information such as the graph data (a main key of a point, a main object of an edge and a direction) stored in a clickwouse, namely, the keys of the points or the edges can be deleted when the data of the whole label is deleted, the data under the label does not need to be read in the RocksDB while the deletion is carried out, and the problem that a large number of deletion tombstones influence query performance due to the deletion so as to influence the whole deletion process can be improved.
Optionally, if the whole tag is used as a deletion object, the graph database suspends receiving services in the graph, and performs a merge operation on the column family storing data in the storage engine after deleting data. Optionally, after the graph data in the storage engine is deleted, the data consistency is realized by deleting the table in the column database management system.
In a specific implementation, if the whole label is used to delete a data set, this operation only occurs when the schema needs to be modified, and the logic of NEST is that all operations that modify the schema need an issuing process, and in the whole issuing process, the function of the data part of the graph is to suspend receiving services, which also avoids data query when deleting. However, after the deletion is completed, the large number of deleted tombstones does not disappear, and in the specific implementation, the LSM-Tree structure can merge the data files through the composition operation and remove the deleted data, so that after each deletion, the column family of the columns storing the data in the RocksDB needs to be manually subjected to the composition, and after the composition is completed, the tombstone disappears, and the query function returns to normal.
In specific implementation, after the graph data in the RocksDB is deleted, the final data consistency can be realized by directly deleting the whole table in the clickwouse. And the whole release process is finished, and all the NEST functions are recovered.
Optionally, if data in a tag is used as a deletion object, a deletion operation is performed through logical deletion, and after the data is deleted, a merging operation is performed on the column family storing the data in the storage engine according to a preset period.
In a specific implementation, if only a certain piece of data under a certain label is deleted, at this time, in order to ensure consistency of the data, it is necessary to synchronize the deletion operation to the ClickHouse, that is, delete the piece of data in the ClickHouse, but the ClickHouse is not friendly to support frequent deletion operations, so that logical deletion, that is, marking deletion, can be used to mark whether the piece of data is deleted through a field, and then partitioning is performed through the field to speed up real physical deletion at regular time.
In the specific implementation, if the deletion operation of the small batch is continuous, a large number of deletion tombstones are generated in the RocksDB after a period of time accumulation, which affects the query operation, and the influence of the large number of deletion tombstones on the query is avoided by performing the compact operation regularly, and optionally, the timing frequency can be determined according to the frequency and the number of the deletion.
In addition, a method of deleting data from a graph database as described in connection with FIG. 1 may be implemented by an electronic device. Fig. 3 is a block diagram of an electronic device of the present invention.
The electronic device may comprise a processor 61 and a memory 62 in which computer program instructions are stored.
Specifically, the processor 61 may include a Central Processing Unit (CPU), or A Specific Integrated Circuit (ASIC), or may be configured to implement one or more Integrated circuits of the embodiments of the present Application.
The memory 62 may be used to store or cache various data files that need to be processed and/or used for communication, as well as possible computer program instructions executed by the processor 61.
The processor 61 implements any of the map database data deletion methods described in the above embodiments by reading and executing computer program instructions stored in the memory 62.
In some of these embodiments, the electronic device may also include a communication interface 63 and a bus 60. As shown in fig. 3, the processor 61, the memory 62, and the communication interface 63 are connected via a bus 60 to complete communication therebetween.
The communication port 63 may be implemented with other components such as: the data communication is carried out among external equipment, image/data acquisition equipment, a database, external storage, an image/data processing workstation and the like.
The bus 60 includes hardware, software, or both to couple the components of the electronic device to one another. Bus 60 includes, but is not limited to, at least one of the following: data Bus (Data Bus), Address Bus (Address Bus), Control Bus (Control Bus), Expansion Bus (Expansion Bus), and Local Bus (Local Bus). By way of example, and not limitation, Bus 60 may include an Accelerated Graphics Port (AGP) or other Graphics Bus, an Enhanced Industry Standard Architecture (EISA) Bus, a Front-Side Bus (FSB), a Hyper Transport (HT) Interconnect, an ISA (ISA) Bus, an InfiniBand (InfiniBand) Interconnect, a Low Pin Count (LPC) Bus, a memory Bus, a microchannel Architecture (MCA) Bus, a PCI (Peripheral Component Interconnect) Bus, a PCI-Express (PCI-X) Bus, a Serial Advanced Technology Attachment (SATA) Bus, a Video Electronics Bus (audio Electronics Association), abbreviated VLB) bus or other suitable bus or a combination of two or more of these. Bus 60 may include one or more buses, where appropriate. Although specific buses are described and shown in the embodiments of the application, any suitable buses or interconnects are contemplated by the application.
The electronic device may execute a method for deleting data from a graph database according to an embodiment of the present application.
In addition, in combination with the method for deleting data from a graph database in the foregoing embodiments, embodiments of the present application may provide a computer-readable storage medium to implement the method. The computer readable storage medium having stored thereon computer program instructions; the computer program instructions, when executed by a processor, implement any of the above-described embodiments of a method for deleting data from a database.
And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method for deleting data from a graph database, comprising:
a step of graph data formatting, in which graph data in a graph database is formatted into a database table, and the database table is synchronized into a column type database management system capable of performing online analysis;
a data query and splicing step, namely using a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splicing key values stored in the storage engine by querying the graph data stored in the column database management system;
and deleting the graph data, namely deleting the graph database according to the key value.
2. The method of deleting data from a graph database according to claim 1, wherein said step of deleting data from a graph further comprises: and if the whole tag is taken as a deleting object, the graph database suspends receiving service in the graph, and after the data is deleted, the column family storing the data in the storage engine is merged.
3. The method of deleting data from a graph database according to claim 2, wherein said step of deleting data from a graph further comprises: and after the graph data in the storage engine is deleted, deleting the table in the column database management system to realize data consistency.
4. The method of deleting data from a graph database according to claim 1, wherein said step of deleting data from a graph further comprises: and if data in a label is taken as a deleting object, deleting operation is carried out through logical deletion, and after the data is deleted, merging operation is carried out on the column group storing the data in the storage engine according to a preset period.
5. A system for deleting data from a graph database, comprising:
the graph data formatting module is used for formatting graph data in a graph database into a database table and synchronizing the database table into a column type database management system capable of performing online analysis;
the data query and splicing module uses a storage engine in an LSM-Tree form as the bottom storage of the graph database, and splices the key values stored in the storage engine by querying the graph data stored in the column-type database management system;
and the graph data deleting module is used for deleting the graph database according to the key value.
6. The system for deleting data from a graph database according to claim 5, wherein said graph data deleting module further comprises: and if the whole tag is taken as a deleting object, the graph database suspends receiving service in the graph, and after the data is deleted, the column family storing the data in the storage engine is merged.
7. The system for deleting data according to claim 6, wherein said graph data deleting module further comprises: and after the graph data in the storage engine is deleted, deleting the table in the column database management system to realize data consistency.
8. The system for deleting data from a graph database according to claim 5, wherein said graph data deleting module further comprises: and if data in a label is taken as a deleting object, deleting operation is carried out through logical deletion, and after the data is deleted, merging operation is carried out on the column group storing the data in the storage engine according to a preset period.
9. An electronic device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the method for deleting data from a graph database according to any of claims 1 to 4 when executing the computer program.
10. A computer-readable storage medium on which a computer program is stored, the program, when executed by a processor, implementing the method for deleting data from a graph database according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110721290.9A CN113536047A (en) | 2021-06-28 | 2021-06-28 | Graph database data deleting method, system, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110721290.9A CN113536047A (en) | 2021-06-28 | 2021-06-28 | Graph database data deleting method, system, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113536047A true CN113536047A (en) | 2021-10-22 |
Family
ID=78126119
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110721290.9A Pending CN113536047A (en) | 2021-06-28 | 2021-06-28 | Graph database data deleting method, system, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113536047A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113721863A (en) * | 2021-11-02 | 2021-11-30 | 支付宝(杭州)信息技术有限公司 | Method and device for managing data |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017044119A1 (en) * | 2015-09-11 | 2017-03-16 | Hewlett Packard Enterprise Development Lp | Graph database and relational database mapping |
| CN108280159A (en) * | 2018-01-16 | 2018-07-13 | 云南大学 | A method of converting chart database to relational database |
| CN109902130A (en) * | 2019-01-31 | 2019-06-18 | 北京明略软件***有限公司 | A kind of date storage method, data query method and apparatus, storage medium |
| CN111090782A (en) * | 2019-12-17 | 2020-05-01 | 北京锐安科技有限公司 | Graph data storage method, device, equipment and storage medium |
| CN112527950A (en) * | 2020-12-18 | 2021-03-19 | 北京明略软件***有限公司 | MapReduce-based graph data deleting method and system |
| CN112740198A (en) * | 2018-09-24 | 2021-04-30 | 易享信息技术有限公司 | System and method for early removal of tombstone records in a database |
-
2021
- 2021-06-28 CN CN202110721290.9A patent/CN113536047A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017044119A1 (en) * | 2015-09-11 | 2017-03-16 | Hewlett Packard Enterprise Development Lp | Graph database and relational database mapping |
| CN108280159A (en) * | 2018-01-16 | 2018-07-13 | 云南大学 | A method of converting chart database to relational database |
| CN112740198A (en) * | 2018-09-24 | 2021-04-30 | 易享信息技术有限公司 | System and method for early removal of tombstone records in a database |
| CN109902130A (en) * | 2019-01-31 | 2019-06-18 | 北京明略软件***有限公司 | A kind of date storage method, data query method and apparatus, storage medium |
| CN111090782A (en) * | 2019-12-17 | 2020-05-01 | 北京锐安科技有限公司 | Graph data storage method, device, equipment and storage medium |
| CN112527950A (en) * | 2020-12-18 | 2021-03-19 | 北京明略软件***有限公司 | MapReduce-based graph data deleting method and system |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113721863A (en) * | 2021-11-02 | 2021-11-30 | 支付宝(杭州)信息技术有限公司 | Method and device for managing data |
| CN113721863B (en) * | 2021-11-02 | 2021-12-31 | 支付宝(杭州)信息技术有限公司 | Method and device for managing data |
| CN114237507A (en) * | 2021-11-02 | 2022-03-25 | 支付宝(杭州)信息技术有限公司 | Method and device for managing data |
| CN114237507B (en) * | 2021-11-02 | 2024-04-12 | 支付宝(杭州)信息技术有限公司 | Method and device for managing data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108319654B (en) | Computing system, cold and hot data separation method and device, and computer readable storage medium | |
| CN106462592B (en) | System and method for optimizing multi-version support for indexes | |
| CN107818115B (en) | Method and device for processing data table | |
| US9195738B2 (en) | Tokenization platform | |
| US8977626B2 (en) | Indexing and searching a data collection | |
| CN107038206B (en) | LSM tree establishing method, LSM tree data reading method and server | |
| CN106874348B (en) | File storage and index method and device and file reading method | |
| CN106815275B (en) | Method and equipment for realizing synchronization of main database and standby database through standby database | |
| US8868526B2 (en) | Parallel segmented index supporting incremental document and term indexing | |
| CN111324665B (en) | Log playback method and device | |
| CN111858520B (en) | Method and device for separately storing block chain node data | |
| CN103678694A (en) | Method and system for establishing reverse index file of video resources | |
| WO2014110940A1 (en) | A method, apparatus and system for storing, reading the directory index | |
| WO2020041950A1 (en) | Data update method, device, and storage device employing b+ tree indexing | |
| US20110246451A1 (en) | Storage device having full-text search function | |
| CN105447168A (en) | Method for restoring and recombining fragmented files in MP4 format | |
| CN113177095A (en) | Enterprise knowledge management method, system, electronic equipment and storage medium | |
| CN114168540A (en) | File index information processing method and device, electronic equipment and storage medium | |
| EP3343395B1 (en) | Data storage method and apparatus for mobile terminal | |
| CN113536047A (en) | Graph database data deleting method, system, electronic equipment and storage medium | |
| CN114297145A (en) | Method, medium and system for searching file based on keywords locally by IPFS node | |
| CN108038253B (en) | Log query processing method and device | |
| CN114115734A (en) | Data deduplication method, device, equipment and storage medium | |
| CN112527950A (en) | MapReduce-based graph data deleting method and system | |
| CN117093579A (en) | Data query and data storage method, device, 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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20231008 Address after: Room 401, 4th Floor, Building J, Yunmi City, No. 19 Ningshuang Road, Yuhuatai District, Nanjing City, Jiangsu Province, 210000 Applicant after: Nanjing Minglue Technology Co.,Ltd. Address before: 100089 a1002, 10th floor, building 1, yard 1, Zhongguancun East Road, Haidian District, Beijing Applicant before: MININGLAMP SOFTWARE SYSTEMS Co.,Ltd. |
|
| TA01 | Transfer of patent application right |