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

An rdf Top-k Query Method Based on Neighbor Vectors

A query method, rdftop-k technology, applied in the field of RDFTop-k query based on neighbor vectors, can solve problems such as noise

Active Publication Date: 2022-08-05
GUILIN UNIV OF ELECTRONIC TECH
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Aiming at problems such as noise existing in current SPARQL, the present invention provides an approximate subgraph matching method based on neighbor vectors

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
  • An rdf Top-k Query Method Based on Neighbor Vectors
  • An rdf Top-k Query Method Based on Neighbor Vectors
  • An rdf Top-k Query Method Based on Neighbor Vectors

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0050] An RDF query method based on neighbor vectors is used to query large-scale RDF data. The method is mainly divided into an offline stage and an online stage. The offline stage mainly includes the preprocessing of RDF data and the construction of indexes. The online stage mainly uses the chi-square value to calculate the matching degree of similar nodes, and expands the approximate matching in a tree manner. Taking the set of triples of RDF dataset as an example, the dataset of RDF is a set of triples, the query problem conforms to the SPARQL standard, because P is a variable rarely occurs in actual query problems Therefore, the present invention does not consider the case where P is a variable, such as figure 1 shown, including the following steps:

[0051]1) Model RDF data and SPARQL query as directed label RDF data graph G and SPARQL query graph Q respectively, use adjacency list to store RDF data graph G and SPARQL query graph Q, and build an inverse adjacency list....

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 an RDF Top-k query method based on neighbor vectors. The method models RDF data and SPARQL query as RDF data graph and SPARQL query graph respectively in the offline stage, and constructs adjacency list, inverse adjacency list, Label node reverse list index, node neighbor node label list index, node h‑hop Neighbor node set, P-In and P-Out indexes; in the matching stage, a chi-square statistical technique is used to measure the similarity of the structure of the neighbor nodes of the candidate node and the labels of the neighbor nodes, and the method of spanning tree is used to measure the similarity. Extended matching; finally, get the Top-k sequences that approximately match the SPARQL query graph, and output the labels of the data graph nodes matched by the variable nodes in the SPARQL query graph in each sequence. The method avoids expensive graph isomorphism and edit distance computation, is robust to label and structure mismatch, and can answer SPARQL approximate query problems accurately and efficiently.

Description

technical field [0001] The invention relates to the technical field of large-scale RDF data query, in particular to an RDF Top-k query method based on neighbor vectors. Background technique [0002] Resource Description Framework (RDF for short) is a framework proposed by W3C to describe information on the World Wide Web, which provides information description specifications for various applications on the Web. SPARQL is a query language defined by the W3C to implement retrieval standards for RDF data. Many applications generate erroneous data when generating RDF data (such as errors introduced by manual data entry, etc.), resulting in dirty RDF data. In addition, in intelligent question answering scenarios, label noise and structure noise are usually introduced when converting natural language questions raised by users into questions that meet SPARQL query criteria. It is difficult for the system to find an answer that fully complies with the SPARQL query question by perf...

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/90335
Inventor 董荣胜刘江江
Owner GUILIN UNIV OF ELECTRONIC TECH
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