Check patentability & draft patents in minutes with Patsnap Eureka AI!

Incremental graph computing method and device for querying large graphs

An incremental, search query technology that can be used in computing, other database queries, program control design, etc., and can solve problems such as heavy lifting

Active Publication Date: 2022-05-31
HUAWEI TECH CO LTD
View PDF12 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This is especially onerous when it comes to large datasets with high update frequency

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
  • Incremental graph computing method and device for querying large graphs
  • Incremental graph computing method and device for querying large graphs
  • Incremental graph computing method and device for querying large graphs

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] It should be understood at the outset that although an illustrative implementation of one or more embodiments is provided below, the disclosed system

[0035] Disclosed herein is a mechanism for updating query results of graphs linking arbitrarily large amounts of data. specific

[0037] The most straightforward way to answer the query 101 is to apply the ΔG 105 described at 102 to the graph 103 and run the query against the results

[0038] The figure also shows another approach. Determine the output caused by the graph update by running query 101 against graph 103

[0039] The latter approach can then be applied and still obtain a

[0040] The present invention includes showing that queries 101 based on KWS, ISO, RPQ and / or SCC can be determined as can be limited to offices

[0041] Various incremental KWS queries will be discussed in the following sections. For example, when ΔG 105 includes edge / node insertions it can be

[0042] The ISO query receives two graphs. The...

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 present invention disclosed a mechanism for the query results for updating the data graphs in the link to the computer system.The system also receives changes to the diagram while receiving the query of the diagram of the link data.The system determines that the changes in the graph can be limited to local or relatively bounded.Based on the determination of the description of the diagram, it can be limited to partial or relatively bounded changes. Without the update results of the query on the diagram, based on the change and update described by the diagramThe result of the query.This is completed by the following ways: the nodes that are influenced by the changes to the graph, update the data related to the affected nodes, and the updated data to apply to the result of the query.

Description

Incremental graph computing method and device for querying large graphs Background technique [0001] Searching large datasets can be a computationally intensive and time-consuming task. For example, social media data can be based on Oversized graph structure for linking. To further complicate things, such large datasets are in terms of node values ​​and node connectivity keep changing. Accordingly, some processes can be automated to repeatedly search the same dataset for the latest data. Such processes are highly computationally intensive as the system repeatedly searches large datasets. For example, the dataset can be and run the search with the search results obtained by the search algorithm. Then, the dataset can be updated. The update may cause The search results are at least partially invalid. The search can then be run again against the updated dataset to get the most recent / more accurate results. The search algorithm may require that the entire dataset...

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 Patents(China)
IPC IPC(8): G06F16/901G06F16/903
CPCG06F16/9024G06F16/90335G06F9/4498
Inventor 樊文飞胡春明田超陈宇德马伊·倪
Owner HUAWEI TECH 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