CN110362706B - Data searching method and device, storage medium and electronic device - Google Patents
Data searching method and device, storage medium and electronic device Download PDFInfo
- Publication number
- CN110362706B CN110362706B CN201910606456.5A CN201910606456A CN110362706B CN 110362706 B CN110362706 B CN 110362706B CN 201910606456 A CN201910606456 A CN 201910606456A CN 110362706 B CN110362706 B CN 110362706B
- Authority
- CN
- China
- Prior art keywords
- data
- graph database
- type
- change
- searching
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/58—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
- G06F16/5866—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using information manually generated, e.g. tags, keywords, comments, manually generated location and time information
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Library & Information Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data searching method, a data searching device, a storage medium and an electronic device, wherein the data searching device comprises the following steps: determining a data search type, wherein the data search type comprises at least one of data change time, data change version number and data change type; according to the method and the device for searching the data in the graph database, the data corresponding to the data searching type is searched in the graph database according to the target label in the graph database, wherein the target label is a label configured in the incidence relation among the data nodes in the graph database, and the target label comprises the data change time, the data change version number and the data change type.
Description
Technical Field
The invention relates to the field of communication, in particular to a data searching method, a data searching device, a data searching storage medium and an electronic device.
Background
For metadata stored based on a graph database, complex relationships can be queried and analyzed very efficiently, but generally, the display is very complex and difficult to achieve well for multiple times of synchronization of metadata, and the main problems are that for the same batch of metadata sources, how to monitor the variation when a third party uses each batch of metadata synchronization, how to distinguish the variation from the past when adding the metadata, and how to query metadata information of a specified variation version.
Therefore, an effective solution to the problem of slow data searching in a graph database in the related art does not exist.
Disclosure of Invention
The embodiment of the invention provides a data searching method, a data searching device, a storage medium and an electronic device, and aims to at least solve the problem that the efficiency of searching data in a graph database is low in the related technology.
According to an embodiment of the present invention, there is provided a method for searching data, including: determining a data search type, wherein the data search type comprises at least one of data change time, data change version number and data change type; and searching data corresponding to the data search type in the graph database according to a target label in the graph database, wherein the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data change time, a data change version number and a data change type.
Optionally, before determining the data lookup type, the method further comprises: determining that data stored in the graph database has changed; performing at least one of the following operations based on the change type: under the condition that the change type is determined to be that first data stored in the graph database is updated to second data, establishing a first connection relation for the second data and the first data, and configuring a first target label for the first connection relation; when the change type is determined that third data are deleted from the graph database, reserving a second connection relation between the third data and fourth data, and configuring a second target label for the second connection relation, wherein the fourth data are data which have a connection relation with the third data before the third data are deleted; and if the change type is determined to be that fifth data is added to the graph database, determining sixth data having a connection relationship with the fifth data, and configuring a third target tag for a third connection relationship between the fifth data and the sixth data.
Optionally, in a case where it is determined that the change type is updated to the second data for the first data stored in the graph database, the method further includes: establishing a second node position having the first connection relation with the first node position where the first data is located; transferring the first data to the second node location and setting the second data at the first node location.
Optionally, the method further comprises: recording the data change time, and generating the data change version number according to the data change time; and adding the data change time, the data change version number and the data change type in the target label.
Optionally, after searching for data corresponding to the data search type in the graph database according to a target tag in the graph database, the method further includes: under the condition that the data corresponding to the data search type exists, returning a set of all data corresponding to the data search type and carrying target labels of all data in the set; and returning all the data in the graph database under the condition that the data corresponding to the data searching type does not exist, wherein the target tags of all the data in the graph database are carried.
According to another embodiment of the present invention, there is provided a data searching apparatus, including: the device comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining a data searching type, and the data searching type comprises at least one of data change time, a data change version number and a data change type; the searching module is used for searching data corresponding to the data searching type in the graph database according to a target label in the graph database, wherein the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data changing time, a data changing version number and a data changing type.
Optionally, the apparatus further comprises: a second determining module for determining that data stored in the graph database has been changed before determining the data lookup type; an execution module to perform at least one of the following operations based on the change type: under the condition that the change type is determined to be that first data stored in the graph database is updated to second data, establishing a first connection relation for the second data and the first data, and configuring a first target label for the first connection relation; when the change type is determined that third data are deleted from the graph database, reserving a second connection relation between the third data and fourth data, and configuring a second target label for the second connection relation, wherein the fourth data are data which have a connection relation with the third data before the third data are deleted; and if the change type is determined to be that fifth data is added to the graph database, determining sixth data having a connection relationship with the fifth data, and configuring a third target tag for a third connection relationship between the fifth data and the sixth data.
Optionally, the apparatus further comprises: the establishing module is used for establishing a second node position having the first connection relation with a first node position where the first data are located under the condition that the change type is determined to be that the first data stored in the graph database are updated into second data; a transfer module, configured to transfer the first data to the second node location, and set the second data in the first node location.
According to a further embodiment of the present invention, there is also provided a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the above method embodiments when executed.
According to yet another embodiment of the present invention, there is also provided an electronic device, including a memory in which a computer program is stored and a processor configured to execute the computer program to perform the steps in any of the above method embodiments.
According to the invention, data corresponding to the data type is searched in the graph database according to the target label summarized by the graph database, and the target label comprises data change time, a data change version number and a data change type. Therefore, the problem of slow data searching efficiency in the graph database can be solved, and the effect of improving the data searching efficiency in the graph database is achieved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention. In the drawings:
fig. 1 is a block diagram of a hardware structure of a mobile terminal of a data search method according to an embodiment of the present invention;
FIG. 2 is a flow diagram of a lookup of data according to an embodiment of the invention;
FIG. 3 is an overall flow diagram of a lookup of data according to another embodiment of the invention;
fig. 4 is a block diagram of a data lookup apparatus according to an embodiment of the present invention.
Detailed Description
The invention will be described in detail hereinafter with reference to the accompanying drawings in conjunction with embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
Example 1
The method provided by the first embodiment of the present application may be executed in a mobile terminal, a computer terminal, or a similar computing device. Taking an example of the present invention running on a mobile terminal, fig. 1 is a block diagram of a hardware structure of the mobile terminal of a data searching method according to an embodiment of the present invention. As shown in fig. 1, the mobile terminal 10 may include one or more (only one shown in fig. 1) processors 102 (the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data, and optionally may also include a transmission device 106 for communication functions and an input-output device 108. It will be understood by those skilled in the art that the structure shown in fig. 1 is only an illustration, and does not limit the structure of the mobile terminal. For example, the mobile terminal 10 may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1.
The memory 104 may be used to store a computer program, for example, a software program and a module of application software, such as a computer program corresponding to the data searching method in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, so as to implement the above-mentioned method. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the mobile terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission device 106 is used for receiving or transmitting data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the mobile terminal 10. In one example, the transmission device 106 includes a Network adapter (NIC), which can be connected to other Network devices through a base station so as to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In this embodiment, a method for searching data running on the mobile terminal is provided, and fig. 2 is a flowchart of searching data according to an embodiment of the present invention, as shown in fig. 2, the flowchart includes the following steps:
step S202, determining a data search type, wherein the data search type comprises at least one of data change time, a data change version number and a data change type;
step S204, searching data corresponding to the data search type in a graph database according to a target label in the graph database, wherein the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data change time, a data change version number and a data change type.
Through the steps, data corresponding to the data type is searched in the graph database according to the target label summarized by the graph database, and the target label comprises data change time, a data change version number and a data change type. Therefore, the problem of slow data searching efficiency in the graph database can be solved, and the effect of improving the data searching efficiency in the graph database is achieved.
Alternatively, the execution subject of the above steps may be a terminal or the like, but is not limited thereto.
In an alternative embodiment, prior to determining the data lookup type, the method further comprises: determining that data stored in the graph database has changed; performing at least one of the following operations based on the change type: under the condition that the change type is determined to be that first data stored in the graph database is updated to second data, establishing a first connection relation for the second data and the first data, and configuring a first target label for the first connection relation; when the change type is determined that third data are deleted from the graph database, reserving a second connection relation between the third data and fourth data, and configuring a second target label for the second connection relation, wherein the fourth data are data which have a connection relation with the third data before the third data are deleted; and if the change type is determined to be that fifth data is added to the graph database, determining sixth data having a connection relationship with the fifth data, and configuring a third target tag for a third connection relationship between the fifth data and the sixth data. In this embodiment, the metadata stored in the graph database is a Node, and an attribute (global _ version _ number, GVN for short) of a global version number is added to each Node. For any change of the node, the GVN of the corresponding node is updated. For a node to be changed, such as delete, update, insert, we add a new tag to such node as alteration _ node (corresponding to the target tag), and we leave a node with the latest information on the primary path of graph database retrieval. Taking data update as an example, replacing a with B, the node on the main path is B, the B node creates a relationship alteration _ type (corresponding to the first connection relationship) and associates with the old node a, the relationship records the detailed information of alteration, such as data alteration time, version number, etc., and adds a modified node alteration _ node tag to the a node. For the nodes added in batches, there is one and the same GVN.
In an alternative embodiment, in the event that a determination is made that the type of change is an update of first data stored in the graph database to second data, the method further comprises: establishing a second node position having the first connection relation with the first node position where the first data is located; transferring the first data to the second node location and setting the second data at the first node location.
In an alternative embodiment, the method further comprises: recording the data change time, and generating the data change version number according to the data change time; and adding the data change time, the data change version number and the data change type in the target label.
In an alternative embodiment, after searching the database for data corresponding to the data search type according to a target tag in the database, the method further comprises: under the condition that the data corresponding to the data search type exists, returning a set of all data corresponding to the data search type and carrying target labels of all data in the set; and returning all the data in the graph database under the condition that the data corresponding to the data searching type does not exist, wherein the target tags of all the data in the graph database are carried. In this embodiment, for example, by querying data of a specified version, we only need to specify an interval of a GVN (v1, v2), and v1 and v2 are version numbers, and specific version number types may be determined according to actual situations, where v1 and v2 are merely for illustration. The designated nodes can be traversed in the main path of the graph database retrieval, whether the designated nodes are in the specified interval is judged according to the GVN of the main path nodes, if the main node is not in the specified interval, all the alteration _ nodes associated with the alteration _ type relation of the nodes are traversed to see whether the nodes have the GVN meeting the specified interval, and if no hit exists in the end, the nodes do not exist in a certain version. The method and the device add version information for the construction of the metadata, and add the version information for each batch when synchronizing the metadata, thereby realizing the version concept in metadata maintenance and various complex analysis query functions taking the version as divergence.
The application is illustrated below by means of a specific example.
Assuming that a copy of metadata of the data source A exists in the existing graph data, after the metadata is synchronized by a third-party user, a batch of newly acquired metadata of the data source A and the like are also stored in the graph database, namely different version information exists; the third party user must be full-scale synchronization during the first synchronization, and the request parameters do not carry the information related to the GVN.
After the third party user synchronizes, there is a GVN message of the current data. When the incremental metadata is synchronized later, GVN information stored last time is transmitted as a parameter. When the metadata service receives the synchronous metadata request and designates the GVN, the data larger than the current GVN is searched for the most result and returned to the third party user according to the internal logic of the invention content, and the current latest GVN information is returned together.
Fig. 3 is an overall flowchart of data search according to another embodiment of the present invention, which specifically includes the following steps:
step 101: sending a synchronization metadata request;
step 102: judging whether the request parameter contains GVN, jumping to step 103 if yes, and jumping to step 104 if not;
step 103: if the GVN is larger than the GVN in the parameters, searching the nodes of which the GVN is larger than the GVN in the graph data, and jumping to the step 105;
step 104: returning a full data set and carrying the current maximum GVN information;
step 105: and returning the retrieved data set and carrying the current maximum GVN information.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
Example 2
In this embodiment, a data searching apparatus is further provided, and the apparatus is used to implement the foregoing embodiments and preferred embodiments, and the description already made is omitted. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. 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. 4 is a block diagram of a data lookup apparatus according to an embodiment of the present invention, and as shown in fig. 4, the apparatus includes: a first determining module 42, configured to determine a data search type, where the data search type includes at least one of a data change time, a data change version number, and a data change type; the searching module 44 is configured to search, in the graph database, data corresponding to the data search type according to a target tag in the graph database, where the target tag is a tag configured in an association relationship between data nodes in the graph database, and the target tag includes data change time, a data change version number, and a data change type.
In an alternative embodiment, the apparatus further comprises: a second determining module for determining that data stored in the graph database has been changed before determining the data lookup type; an execution module to perform at least one of the following operations based on the change type: under the condition that the change type is determined to be that first data stored in the graph database is updated to second data, establishing a first connection relation for the second data and the first data, and configuring a first target label for the first connection relation; when the change type is determined that third data are deleted from the graph database, reserving a second connection relation between the third data and fourth data, and configuring a second target label for the second connection relation, wherein the fourth data are data which have a connection relation with the third data before the third data are deleted; and if the change type is determined to be that fifth data is added to the graph database, determining sixth data having a connection relationship with the fifth data, and configuring a third target tag for a third connection relationship between the fifth data and the sixth data.
In an alternative embodiment, the apparatus further comprises: the establishing module is used for establishing a second node position having the first connection relation with a first node position where the first data are located under the condition that the change type is determined to be that the first data stored in the graph database are updated into second data; a transfer module, configured to transfer the first data to the second node location, and set the second data in the first node location.
In an alternative embodiment, the apparatus is further configured to record the data change time, and generate the data change version number according to the data change time; and adding the data change time, the data change version number and the data change type in the target label.
In an optional embodiment, the apparatus is further configured to, after searching for data corresponding to the data search type in the graph database according to a target tag in the graph database, return a set of all data corresponding to the data search type and carrying target tags of all data in the set in the case that there is data corresponding to the data search type; and returning all the data in the graph database under the condition that the data corresponding to the data searching type does not exist, wherein the target tags of all the data in the graph database are carried.
It should be noted that, the above modules may be implemented by software or hardware, and for the latter, the following may be implemented, but not limited to: the modules are all positioned in the same processor; alternatively, the modules are respectively located in different processors in any combination.
Example 3
Embodiments of the present invention also provide a storage medium having a computer program stored therein, wherein the computer program is arranged to perform the steps of any of the above method embodiments when executed.
Alternatively, in the present embodiment, the storage medium may be configured to store a computer program for executing the steps of:
s1, determining a data search type, wherein the data search type comprises at least one of data change time, data change version number and data change type;
s2, searching data corresponding to the data search type in the graph database according to a target label in the graph database, wherein the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data change time, a data change version number and a data change type.
Optionally, in this embodiment, the storage medium may include, but is not limited to: various media capable of storing computer programs, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Embodiments of the present invention also provide an electronic device comprising a memory having a computer program stored therein and a processor arranged to run the computer program to perform the steps of any of the above method embodiments.
Optionally, the electronic apparatus may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.
Optionally, in this embodiment, the processor may be configured to execute the following steps by a computer program:
s1, determining a data search type, wherein the data search type comprises at least one of data change time, data change version number and data change type;
s2, searching data corresponding to the data search type in the graph database according to a target label in the graph database, wherein the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data change time, a data change version number and a data change type.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments and optional implementation manners, and this embodiment is not described herein again.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the principle of the present invention should be included in the protection scope of the present invention.
Claims (8)
1. A method for searching data, comprising:
determining a data search type, wherein the data search type comprises at least one of data change time, data change version number and data change type;
searching data corresponding to the data search type in a graph database according to a target label in the graph database, wherein the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data change time, a data change version number and a data change type;
prior to determining the data lookup type, the method further comprises:
determining that data stored in the graph database has changed;
performing at least one of the following operations based on the change type:
under the condition that the change type is determined to be that first data stored in the graph database is updated to second data, establishing a first connection relation for the second data and the first data, and configuring a first target label for the first connection relation;
when the change type is determined that third data are deleted from the graph database, reserving a second connection relation between the third data and fourth data, and configuring a second target label for the second connection relation, wherein the fourth data are data which have a connection relation with the third data before the third data are deleted;
and if the change type is determined to be that fifth data is added to the graph database, determining sixth data having a connection relationship with the fifth data, and configuring a third target tag for a third connection relationship between the fifth data and the sixth data.
2. The method according to claim 1, wherein in the case where it is determined that the type of change is an update of first data stored in the graph database to second data, the method further comprises:
establishing a second node position having the first connection relation with the first node position where the first data is located;
transferring the first data to the second node location and setting the second data at the first node location.
3. The method according to any one of claims 1 or 2, further comprising:
recording the data change time, and generating the data change version number according to the data change time;
and adding the data change time, the data change version number and the data change type in the target label.
4. The method of claim 1, wherein after searching the graph database for data corresponding to the data search type according to a target tag in the graph database, the method further comprises:
under the condition that the data corresponding to the data search type exists, returning a set of all data corresponding to the data search type and carrying target labels of all data in the set;
and returning all the data in the graph database under the condition that the data corresponding to the data searching type does not exist, wherein the target tags of all the data in the graph database are carried.
5. An apparatus for searching data, comprising:
the device comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining a data searching type, and the data searching type comprises at least one of data change time, a data change version number and a data change type;
the system comprises a searching module, a searching module and a searching module, wherein the searching module is used for searching data corresponding to a data searching type in a graph database according to a target label in the graph database, the target label is a label configured in an incidence relation between data nodes in the graph database, and the target label comprises data changing time, a data changing version number and a data changing type;
the device further comprises: a second determining module for determining that data stored in the graph database has been changed before determining the data lookup type; an execution module to perform at least one of the following operations based on the change type: under the condition that the change type is determined to be that first data stored in the graph database is updated to second data, establishing a first connection relation for the second data and the first data, and configuring a first target label for the first connection relation; when the change type is determined that third data are deleted from the graph database, reserving a second connection relation between the third data and fourth data, and configuring a second target label for the second connection relation, wherein the fourth data are data which have a connection relation with the third data before the third data are deleted; and if the change type is determined to be that fifth data is added to the graph database, determining sixth data having a connection relationship with the fifth data, and configuring a third target tag for a third connection relationship between the fifth data and the sixth data.
6. The apparatus of claim 5, further comprising:
the establishing module is used for establishing a second node position having the first connection relation with a first node position where the first data are located under the condition that the change type is determined to be that the first data stored in the graph database are updated into second data;
a transfer module, configured to transfer the first data to the second node location, and set the second data in the first node location.
7. A storage medium, in which a computer program is stored, wherein the computer program is arranged to perform the method of any of claims 1 to 4 when executed.
8. An electronic device comprising a memory and a processor, wherein the memory has stored therein a computer program, and wherein the processor is arranged to execute the computer program to perform the method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910606456.5A CN110362706B (en) | 2019-07-05 | 2019-07-05 | Data searching method and device, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910606456.5A CN110362706B (en) | 2019-07-05 | 2019-07-05 | Data searching method and device, storage medium and electronic device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110362706A CN110362706A (en) | 2019-10-22 |
| CN110362706B true CN110362706B (en) | 2022-02-08 |
Family
ID=68218385
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910606456.5A Active CN110362706B (en) | 2019-07-05 | 2019-07-05 | Data searching method and device, storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110362706B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012148435A1 (en) * | 2011-04-28 | 2012-11-01 | Intuit Inc. | Graph databases for storing multidimensional models of software offerings |
| CN106227800A (en) * | 2016-07-21 | 2016-12-14 | 中国科学院软件研究所 | The storage method of the big data of a kind of highlights correlations and management system |
| CN109145121A (en) * | 2018-07-16 | 2019-01-04 | 浙江大学 | A kind of quick storage querying method of time-varying diagram data |
-
2019
- 2019-07-05 CN CN201910606456.5A patent/CN110362706B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012148435A1 (en) * | 2011-04-28 | 2012-11-01 | Intuit Inc. | Graph databases for storing multidimensional models of software offerings |
| CN106227800A (en) * | 2016-07-21 | 2016-12-14 | 中国科学院软件研究所 | The storage method of the big data of a kind of highlights correlations and management system |
| CN109145121A (en) * | 2018-07-16 | 2019-01-04 | 浙江大学 | A kind of quick storage querying method of time-varying diagram data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110362706A (en) | 2019-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108427684B (en) | Data query method and device and computing equipment | |
| CN111666326B (en) | ETL scheduling method and device | |
| CN109818848B (en) | Session display method and device, storage medium and electronic device | |
| CN105740048A (en) | Image management method, device and system | |
| CN110427368A (en) | Data processing method, device, electronic equipment and storage medium | |
| CN106874281B (en) | Method and device for realizing database read-write separation | |
| CN110413845B (en) | Resource storage method and device based on Internet of things operating system | |
| CN110532493B (en) | Data processing method and device, storage medium and electronic device | |
| CN111400407A (en) | Data synchronization method and device, storage medium and electronic device | |
| CN104834660A (en) | Interval based fuzzy database search | |
| CN102202087A (en) | Method for identifying storage equipment and system thereof | |
| CN110765165A (en) | Method, device and system for synchronously processing cross-system data | |
| CN113704790A (en) | Abnormal log information summarizing method and computer equipment | |
| CN111008220A (en) | Dynamic identification method and device of data source, storage medium and electronic device | |
| CN111104450B (en) | Target data importing method, medium, device and computing equipment | |
| CN113051271A (en) | Cold and hot data separation method, device and equipment | |
| CN110362706B (en) | Data searching method and device, storage medium and electronic device | |
| CN110716938A (en) | Data aggregation method and device, storage medium and electronic device | |
| CN110688355A (en) | Method and device for changing container state | |
| CN107977381B (en) | Data configuration method, index management method, related device and computing equipment | |
| CN115794876A (en) | Fragment processing method, device, equipment and storage medium for service data packet | |
| US8359383B2 (en) | Ubiquitous service framework system for supporting service in multiple domain and method thereof | |
| CN111177162A (en) | Data synchronization method and device | |
| CN111506646A (en) | Data synchronization method, device, system, storage medium and processor | |
| CN113852919B (en) | Method and device for generating early warning message, storage medium and electronic device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |