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

A database and graphics technology, applied in the field of graph databases, can solve problems such as writing to graph databases

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

AI Technical Summary

Problems solved by technology

[0004] This application provides a method for writing a graph database, electronic equipment and a computer-readable storage medium, which can solve the problem of writing massive 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 graphic database, electronic device and computer-readable storage medium
  • Method for writing graphic database, electronic device and computer-readable storage medium
  • Method for writing graphic database, electronic device and computer-readable storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

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

[0059] Step S101. Obtain each vertex data carrying a vertex identifier and each edge data from a distributed file system through a distributed computing platform.

[0060] Wherein, any side data carries the vertex identifiers corresponding to the two vertices corresponding to the side data.

[0061] For this embodiment of the application, the distributed computing platform may be a Spark distributed computing platform. In the embodiment of this application, Spark is a common parallel computing framework for Hadoop-like mapping reduction MapReduce open sourced by UC Berkeley AMP lab. The distributed computing realized by Spark based on the map reduce algorithm has the advantages of Hadoop MapReduce; but different What is unique to MapReduce is that the intermediate output and results of the Job can be stored in the memory, so th...

Embodiment 2

[0070] The embodiment of the present application provides another possible implementation mode. On the basis of the first embodiment, the method shown in the second embodiment is also included, wherein,

[0071] Step S101 also includes step Sa (not marked in the figure) and step Sb (not marked in the figure) before step S101, may also include before step Sa: Sc, and also includes step Sd (not marked in the figure) and step Se before step Sc (not marked in the figure), wherein, step Sa and step Sb can not be realized independently based on step Sc, step Sd and step Se, also can be realized on the basis of step Sc, step Sd and step Se; Step Sc can not be based on step Sd and step Se are realized, and may also be realized based on step Sd and step Se. It is not limited in the embodiment of this application.

[0072] Step Sd, obtaining the pre-generated mapping relationship between vertices and vertex identifiers from the external vertex identifier generator.

[0073] For the em...

Embodiment 3

[0092] Another possible implementation of the embodiments of the present application further includes the operations shown in the third embodiment on the basis of any one of the first to second embodiments, wherein,

[0093] Step S102 includes step S1021 (not marked in the figure), wherein,

[0094] Step S1021 , write the obtained vertex data carrying vertex identifiers and each edge data into the graph database through the distributed computing platform and using the multi-node parallel mode.

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

[0096] 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.

[0097] For exa...

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 a graphic database, an electronic device, and a computer-readable storage medium, and relate to the graphic database technology field. The method comprises obtaining the vertex data carrying the vertex identifiers and the edge data from a distributed file system through a distributed computing platform, wherein the data on eitherside carries the vertex identifiers corresponding to the two vertices corresponding to the edge data, and then writting the vertex data carrying the vertex identifiers and the edge data into a graphics database through the distributed computing platform. Embodiments of the present application realize the purpose of writing 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/51G06F16/182G06F16/25
Inventor 何任天
Owner BEIJING QIHOO TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap