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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0050]A neighbor vector-based RDF query method for querying large-scale RDF data. The method is mainly divided into an offline stage and an online stage. The offline stage mainly includes RDF data preprocessing and index construction. In the online stage, the chi-square value is mainly used to calculate the matching degree of similar nodes, and the extended approximate matching is performed in the form of a tree. Take the set of triples in the RDF data set as an example. The data set of RDF is a set of triples. The query problem conforms to the SPARQL standard, because P is rarely a variable in the actual query problem The situation, so the present invention does not consider the situation that P is a variable, such as figure 1 shown, including the following steps:
[0051] 1) Model RDF data and SPARQL query as directed labeled RDF data graph G and SPARQL query graph Q respectively, use adjacency table to store RDF data graph G and SPARQL query graph Q, and build an inverse ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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