Supercharge Your Innovation With Domain-Expert AI Agents!

Graph data deleting method and system based on MapReduce

A deletion method and graph data technology, applied in the field of big data, can solve problems such as the influence of subjective factors, achieve the effect of improving data processing efficiency and reducing network overhead

Pending Publication Date: 2021-03-19
BEIJING MININGLAMP SOFTWARE SYST CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The embodiment of the present application provides a method for deleting graph data based on MapReduce to at least solve the problem of subjective factors in related technologies

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
  • Graph data deleting method and system based on MapReduce
  • Graph data deleting method and system based on MapReduce
  • Graph data deleting method and system based on MapReduce

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0072] refer to Figure 1 to Figure 6 As shown, this example discloses a specific implementation of a MapReduce-based graph data deletion method (hereinafter referred to as "method").

[0073] Specifically, when performing data operations on HBase, it is necessary to understand the data storage structure of JanusGraph in HBase. In JanusGraph, the point is the center and the data is stored in the form of edge cutting. The ID of the node is used as the Rowkey of HBase, and each attribute and each edge on the node is used as an independent Cell of the Rowkey, that is, each attribute , Each edge is an independent KCV structure (Key-Column-Value). JanusGraph defines each element in the graph as a RelationType, and assigns it an id, including whether there are marker points (VertexExists), point Label points (VertexLabel), attribute points, edge Label points (EdgeLabel), etc. JanusGraph assigns each point an ID called RelationTypeId. JanusGraph also defines three directions: PROP...

Embodiment 2

[0125] In combination with the MapReduce-based graph data deletion method disclosed in Embodiment 1, this embodiment discloses a specific implementation example of a MapReduce-based graph data deletion system (hereinafter referred to as "system").

[0126] refer to Figure 7 As shown, the system includes:

[0127] Judging module 10, whether the Label information stored on the judging point is equal to the VertexLabel to be deleted, determines the point to be deleted;

[0128] The index deletion module 20 deletes the index of the point to be deleted;

[0129] The opposite end point deletion module 30, deletes the side information on the opposite end point of the point to be deleted;

[0130] The point deletion module 40 uses HBase delete Rowkey to delete the point to be deleted.

[0131] Specifically, in some of these embodiments, the judgment module 10 specifically includes:

[0132] Given unit 11, given the VertexLabel to be deleted;

[0133] VertexLabelId acquisition un...

Embodiment 3

[0151] combine Figure 8 As shown, this embodiment discloses a specific implementation manner of a computer device. The computer device may comprise a processor 81 and a memory 82 storing computer program instructions.

[0152] Specifically, the processor 81 may include a central processing unit (CPU), or an Application Specific Integrated Circuit (ASIC for short), or may be configured to implement one or more integrated circuits in the embodiments of the present application.

[0153] Among them, the memory 82 may include mass storage for data or instructions. For example without limitation, the memory 82 may include a hard disk drive (Hard Disk Drive, referred to as HDD), a floppy disk drive, a solid state drive (SolidState Drive, referred to as SSD), flash memory, optical disk, magneto-optical disk, magnetic tape or universal serial bus (Universal Serial Bus, referred to as USB) drive or a combination of two or more of the above. Storage 82 may comprise removable or non-r...

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

The invention discloses a graph data deletion method and system based on MapReduce, and the method comprises the following steps: judging whether Label information stored on a point is equal to VertexLabel to be deleted or not, and determining the point to be deleted; deleting the index of the point to be deleted; deleting edge information on an opposite end point of the point to be deleted; and deleting the to-be-deleted point by using the HBase delay Rowkey according to the to-be-deleted point. According to the method and the system, the atlas data can be quickly and efficiently deleted under the condition that the original data is missing.

Description

technical field [0001] The invention relates to the technical field of big data. More specifically, the present invention relates to a map data deletion method and system based on MapReduce. Background technique [0002] The knowledge graph is used to describe the relationship between things. A specific description of the knowledge graph includes defining the entities in the graph (that is, the points in the graph), the relationships (that is, the edges in the graph) and the attributes related to entities / relationships ( That is, the property graph), whose description and definition are inseparable from the use of the graph database. The current common practice is to import the original data of the real entity relationship into the graph database, and then realize the construction of the knowledge graph through the interface of the graph database. [0003] JanusGraph is a highly scalable distributed graph database, MapReduce is a programming model based on parallel computin...

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
IPC IPC(8): G06F16/31G06F16/335G06F16/36
CPCG06F16/328G06F16/335G06F16/367
Inventor 柴晓瑞
Owner BEIJING MININGLAMP SOFTWARE SYST CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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