Supercharge Your Innovation With Domain-Expert AI Agents!

Method and device for searching graph data

A graph data and data technology, applied in the field of graph data retrieval methods and devices, can solve the problem of low efficiency and achieve the effect of improving retrieval efficiency

Inactive Publication Date: 2015-06-03
FOUNDER INFORMATION IND HLDG +1
View PDF1 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, when the sparql language is used for graph traversal retrieval, the operation of traversing from a certain vertex of a graph to another associated vertex through an edge generally requires two index accesses, specifically, searching for a vertex related to the vertex by traversing a certain vertex. The associated edge, and then further search for the associated vertex of the vertex from the found edge, the efficiency is not high

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 and device for searching graph data
  • Method and device for searching graph data
  • Method and device for searching graph data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0077] The sparql statement for retrieval is as follows:

[0078] select ?square

[0079] where

[0080] {Yao Ming's birthplace ?city.

[0081] ?city belongs to ?country.

[0082] ?country area ?square}

[0083] The description of the above query statement means that a path needs to be queried:

[0084] Yao Ming→birthplace→which city→belongs to→which country→area→how much, and finally hope to get the territory area of ​​the country where Yao Ming was born.

[0085] Then, when the prior art is used for retrieval, the above process involves a total of 6 retrieval visits to the index.

[0086] According to the method provided by the embodiment of the present invention, before searching, the vertex information of all the first vertices whose subject is Yao Ming not only includes the first identifier that can uniquely identify the subject "Yao Ming", but also includes the first identifier that can uniquely identify all the vertices that will be The second identifier of the pr...

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 provides a method and a device for searching graph data. The method comprises the steps of determining keywords to be searched at present, wherein the keywords include a first identifier capable of uniquely identifying the first top point in a graph, and a second identifier capable of uniquely identifying the side associated with the first top point in the graph; searching the graph data through a first access index according to the keywords to obtain a third identifier which can uniquely identify a second top point associated with the first top point in the graph. According to the method, the operation from some top point of one graph to another associated top point by side traversing involves only one index access, so that the graph data search efficiency can be increased.

Description

technical field [0001] The invention relates to the field of graph data processing, in particular to a graph data retrieval method and device. Background technique [0002] The Resource Description Framework (RDF) is a set of markup language technical standards proposed by the World Wide Web Consortium (w3c), in order to describe and express the content and structure of Web resources more abundantly. Specifically, RDF can be specially used to express metadata about Web resources, such as the title, author and modification time of Web pages, copyright and license information of Web documents, and the availability schedule of a shared resource. However, by generalizing the concept of Web resources, RDF can be used to express information about anything that can be identified on the Web. With the development of semantic-based web description, RDF data is increasingly used in Semantic Web-related applications. [0003] A graph is a collection of multiple vertices and edges with...

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): G06F17/30
Inventor 郑程光郭春庭王浩
Owner FOUNDER INFORMATION IND HLDG
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