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

Caching of subgraphs and integration of cached subgraphs into graph query results

A technology of query results and subgraphs, which can be used in memory systems, instruments, and other database retrieval directions, and can solve problems such as high cost.

Active Publication Date: 2019-08-23
MICROSOFT TECH LICENSING LLC
View PDF15 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The number of scaling levels is open, and as the complexity of queries and the size of the graph database increase, the cost of each query having to span an entire subgraph can become prohibitively large

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
  • Caching of subgraphs and integration of cached subgraphs into graph query results
  • Caching of subgraphs and integration of cached subgraphs into graph query results
  • Caching of subgraphs and integration of cached subgraphs into graph query results

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0015] The following detailed description refers to the accompanying drawings. Where possible, the same reference numbers are used in the drawings and the following description to refer to the same or similar elements. While a few examples have been described, modifications, adaptations, and other implementations thereof are possible. For example, substitutions, additions, or modifications may be made to components shown in the figures, and the methods described herein may be modified by substituting, reordering, or adding stages to the disclosed methods. Therefore, the following detailed description is not intended to limit the present invention, but the proper protection scope of the present invention is defined by the appended claims. Examples may take a hardware implementation, or an entirely software implementation, or an implementation combining software and hardware aspects. Therefore, the following detailed description should not be taken in a limiting sense.

[001...

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

Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and / or improving computational efficiency when traversing data stored in a relationalgraph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.

Description

Background technique [0001] In a graph database, entities are represented as nodes and the relationships between these entities are represented as edges in the view of the relational graph maintained by the graph database. Users can periodically query the relationship graph via graph query to understand the relationship between entities. For example, a user may issue a graph query to find friends or contacts within a social network, documents a given user has interacted with, users who have visited a given document, entities satisfying various search criteria, and so on. Graph query generates subgraphs in the queried graph database that satisfy the query conditions. Furthermore, it is not uncommon for a graph query to start at a node, then follow some set of relationships for a new set of nodes, and then extend to another set of nodes along a new set of relationships. The number of scaling levels is open, and as the complexity of queries and the size of the graph database in...

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/901
CPCG06F16/9024G06F16/532G06F12/0893
Inventor T·克勒策A·克瓦尔内斯S·维肯瓦尔瓦格A·K·约翰森D·S·埃德森P·D·亨J-O·A·卡尔伯格
Owner MICROSOFT TECH LICENSING LLC
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