Keyword-based RDF distributed semantic search method

A semantic search and distributed technology, applied in the field of RDF distributed semantic search based on keywords, can solve the problems of ignoring the semantic relationship between RDF data, achieve the effect of improving query performance, avoiding iterative calculation, and reducing the number of tasks

Active Publication Date: 2016-10-12
FUZHOU UNIV
View PDF2 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

De Virgilio et al. proposed a new distributed RDF keyword search method, which uses MapReduce to convert the graph parallel problem into a data parallel processing problem, but ignores the semantic relationship between RDF data

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
  • Keyword-based RDF distributed semantic search method
  • Keyword-based RDF distributed semantic search method
  • Keyword-based RDF distributed semantic search method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] The technical solution of the present invention will be described in detail below in conjunction with the drawings.

[0024] The existing keyword search scheme on the graph improves the search efficiency by establishing an inverted index for all keyword vertices in the graph data and pre-calculating the shortest path between all vertices, but the premise of this design scheme is to assume that the graph data can be It is obviously impractical for massive distributed semantic web data-RDF graph data with millions or even hundreds of millions of vertices to be fully loaded into memory and perform multiple iteration calculations on the graph. The current keyword search scheme on the graph uses a graph structure to represent data. With the help of an effective index, it is relatively easy to find the vertices of matching keywords from the graph data. However, iteratively search between the keyword vertices on large-scale RDF graph data The connection is a complex problem, whic...

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 relates to a keyword-based RDF distributed semantic search method. The method comprises the steps of constructing a semantic feasible path of input query keywords based on an RDF ontology; performing score sorting according to semantic content and a semantic structure of query content in the construction stage; generating Top-k semantic feasible paths; and performing a parallel search by utilizing a MapReduce computing framework and returning Top-k query results. According to the keyword-based RDF distributed semantic search method proposed by the invention, the semantic feasible paths are constructed and searched for based on the ontology and interconnection paths among the query keywords are determined, so that time-consuming iterative computing directly on a large-scale RDF data map is avoided; and parallel computing is realized by utilizing a MapReduce computing model, so that the overall computing complexity is effectively lowered for improving query performance.

Description

Technical field [0001] The invention relates to the technical field of massive RDF data retrieval, in particular to a keyword-based RDF distributed semantic search method. Background technique [0002] As the foundation of the Semantic Web, RDF expresses information in the form of triples and exchanges knowledge and data on the World Wide Web. The increasing scale of Semantic Web data requires query processing to evolve into large-scale RDF data processing distributed storage. At present, keyword queries on RDF can be divided into two categories according to different query processing methods: keyword structuring methods and keyword direct matching methods. The first keyword structuring method is to translate keywords into joint queries, and then get SPARQL query sentences. Literature Rdf keyword search based on keywords-to-sparql translation[C] combines the data graph to map the subgraph containing the user's query keywords into a query statement, translate it into a SPARQL qu...

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): G06F17/30G06F17/27
CPCG06F16/24522G06F16/2471G06F16/27G06F40/30
Inventor 汪璟玢陈双
Owner FUZHOU UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap