Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for writing in graphic database, electronic device and computer-readable storage medium

A database and graph technology, applied in the field of graph database

Inactive Publication Date: 2019-02-15
BEIJING QIHOO TECH CO LTD
View PDF5 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The application provides a method for writing a graph database, an electronic device and a computer-readable storage medium, which can solve the problem of writing a large amount of data into a graph database

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for writing in graphic database, electronic device and computer-readable storage medium
  • Method for writing in graphic database, electronic device and computer-readable storage medium
  • Method for writing in graphic database, electronic device and computer-readable storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0045] The embodiment of the present application provides a method for writing in a graph database, such as figure 1 As shown, the method includes:

[0046] Step S101, obtaining each vertex data and each edge data.

[0047] Among them, the vertex data is the attribute information of the vertex; the edge data includes the relationship attribute information between vertices.

[0048]For the embodiment of the present application, the data to be written into the graph database is obtained from the source database, and the data includes each vertex data and each edge data to be written into the graph database. In the embodiment of the present application, the source database may be a relational database or a non-relational database, and the graph database may be non-relational data.

[0049] For this embodiment of the application, the vertices in the graph database may represent a person, a department, or a company. It is not limited in the embodiment of this application. In th...

Embodiment 2

[0060] Another possible implementation of the embodiment of the present application, on the basis of the first embodiment, also includes the operations shown in the second embodiment, wherein,

[0061] Step S102 includes: Step S1021 (not marked in the figure), wherein,

[0062] Step S1021. Obtain the mapping relationship between vertices and vertex identifiers from an external vertex identifier generator.

[0063] Wherein, the mapping relationship between vertices and vertex identifiers is pre-generated by an external vertex identifier generator.

[0064] For the embodiment of the present application, before writing each vertex data and each edge data into the graph database, an external vertex identifier generator is used to generate a mapping relationship between vertices and vertex identifiers. In the embodiment of the present application, when writing each vertex data and each edge data into the graph database, the pre-generated mapping relationship between vertices and v...

Embodiment 3

[0071] Another possible implementation of the embodiment of the present application further includes the operations shown in the third embodiment on the basis of the first or second embodiment, wherein,

[0072] Step S103 includes step S1031 (not marked in the figure), wherein,

[0073] Step S1031 , based on the mapping relationship between vertices and vertex identifiers, and through multi-node parallel mode, write each vertex data and each edge data into the graph database.

[0074] Wherein, the multi-node parallel mode is a mode in which data is written in parallel through multiple servers.

[0075] For the embodiment of the present application, each vertex data and each edge data are written into the graph database through a multi-node parallel mode, that is, the data to be written into the graph database is written into the graph database in parallel through multiple nodes. In this embodiment of the application, a node may be a server.

[0076] For example, a part of ve...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

Embodiments of the present application provide a method for writing in a graphic database, an electronic device, and a computer-readable storage medium, and relate to the graphic database technology field. The method comprises the following steps of acquiring each vertex data and each edge data, then acquiring the mapping relationship between the vertex and the vertex identifiers, and writing eachvertex data and each edge data into the graphic database based on the mapping relationship between the vertex and the vertex identifiers. Embodiments of the present application realize the purpose ofwriting the massive amounts of data into the graphic database.

Description

technical field [0001] The present application relates to the technical field of graph databases. Specifically, the present application relates to a method for writing a graph database, an electronic device, and a computer-readable storage medium. Background technique [0002] With the development of information technology, database storage technology emerges as the times require. Data is stored in the database through the data structure. In the data structure, a graph is a collection of vertices and edges, and vertices and edges can have their own attributes. In scenarios such as personalized recommendations on the Internet, knowledge graphs, and social networks, it is intuitive and efficient to use graphs to store data. The scale of graphs can be very large, such as tens of billions of nodes and hundreds of billions of relationships. Node data and the relationship between nodes, the graph database is generated accordingly. [0003] A graph database is a non-relational dat...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/51
Inventor 孟金双
Owner BEIJING QIHOO TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com