7 results about "Rdf graph" patented technology

This provides a computer implementation method for executing linearly recursive queries on an RDF (Resource Description Framework) graph database using a query engine. [Solution] The method includes the steps of: obtaining a first part of a query that defines one or more initial conditions for query elements in a second part of a query on an RDF graph database as input; and obtaining at least two clauses that specify that the second part of the query is executed recursively. The first clause defines how the output of the execution of the second part of the query is used as input for the next execution of the second part of the query. The second clause includes query elements that define the second part of the query and describe how the output of the execution is queried using (i) one or more initial conditions as input for the first execution or (ii) the output of the previous execution for the next execution.

A computer-implemented method for generating by a query engine a graph of operators for a SPARQL query over an RDF graph. The method includes obtaining a graph of operators executable by the query engine, the graph comprising a plurality of basic operators, at least two of said operators being of a first type each configured to find RDF triples of the RDF graph that match a respective basic graph pattern. The method further comprises identifying a group of operators among the at least two basic operators of the graph which are of the first type. The respective basic graph patterns of the group of operators have same subject and / or predicate and / or object and the identified group of operators is replaced in the graph by an equivalent operator configured to find RDF triples of the RDF graph that match the respective basic graph patterns of the group of operators.

The application discloses a kind of based on ontology organization method of knowledge graph, belong to knowledge graph technical field.First, element ontology structure and ontology element knowledge graph structure are defined;Through big language model and rdflib library, the entity data information of RDF graph model is extracted and is converted into triple, is stored and forms the structured data layer of knowledge graph, selects core element entity, the name, definition structure feature and graph structure feature are vectorized and the similarity of core entity pair is calculated, traverses and merges entity pair, based on entity pair, the most authoritative value of core element entity node is calculated.The application realizes ontology fine-grained organization and cross ontology accurate alignment by analyzing ontology semantic element, effectively improves the automation degree and accuracy of ontology organization process.

The invention relates to an industrial ontology matching method and system based on a sum graph isomorphic network, and belongs to the technical field of semantic network and natural language processing. The method comprises the following steps: firstly, inputting an ontology file into a model, and generating an RDF graph structure and a semantic embedding vector of each concept; secondly, jointly inputting the semantic embedding vector and the RDF graph structure into a graph isomorphic network model which adopts a multi-head self-attention mechanism to realize inter-node information interaction and structural dependence modeling, and extracting structural features of the graph through message passing and feature aggregation; carrying out fusion and nonlinear transformation on the features of the nodes and the historical states of the nodes, updating the features of the nodes, and generating a structure embedding vector; thirdly, fusing the semantic embedding vector and the structure embedding vector by adopting a gating aggregator to obtain a comprehensive embedding vector; and finally, calculating the similarity between the concepts, and determining an optimal matching relationship. According to the method, the problem that the isomorphic invariance of the graph cannot be ensured by a traditional method is solved, and the matching accuracy is improved.

A Linked Data Hypergraph (LDH) System and method that serializes RDF data in a plurality of triples where some of the plurality of triples form two-triple hyperedges with a hypernode as common node in either the triple subject or triple object position. The LDH system and method using a Linked Data Hypergraph Ontology (LDHO) enables an improved query and modeling of digital twin objects through space-time. The LDH system operates using an RDF graph database having a plurality of named graphs each serializing a digital twin of an object and wherein each named graph and each serialized digital twin has a URI associated therewith and a Linked Data Hypergraph Awareness (LDHA) configured to use the LDHO specifications to transform each of the serialized digital twins into a digital twin model when loaded, perform inference, and respond to queries with answers returned in RDF Linked Data.

A computer-implemented method that validates SHACL graphs on RDF graphs within a relational database system. SHACL graphs include shape-target pairs, where the shape represents a constraint a node must satisfy, and the target specifies which node to validate. RDF graphs consist of RDF terms, represented as nodes (subject, predicate, object) using IRIs, literals, or blank node identifiers. Each node is associated with a unique identifier, and relationships are stored in a relational database. The method compiles SHACL graphs into SQL expressions by converting them into negation normal form, applying negations to atomic constraints, and translating these into SQL using a lookup table. Validation is performed by executing SQL expressions on the database, ensuring each node satisfies the SHACL constraints.

The invention relates to data security, in particular to a method and a system for selectively disclosing verifiable certificates based on associated data, which are used for solving the problems that the selective calculation amount of the existing verifiable certificates is large, the efficiency is low, the relationship among attributes in the certificates cannot be reflected for a plurality of certificates, and a user is not constrained. According to the scheme, under the framework of the RDF graph, the attributes in the voucher are represented by triples, and a monotone expansion scheme and a linear secret sharing scheme are used for efficiently restraining the attributes which can be selectively disclosed by a user, so that malicious behaviors of the user are prevented; according to the method and the device, attributes in a single voucher can be selectively disclosed, and attribute information association can be carried out after selective disclosure of a plurality of vouchers, so that effective combination of the vouchers can be realized, and meanings to be expressed by the disclosed information can be accurately and efficiently transmitted to a verification party. On the basis, signatures of a plurality of vouchers are aggregated into a BLS signature, so that the purpose of combining the vouchers is achieved.