Blank Node Matching and RDF/S Comparison Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-35176-1_37
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Suggestion-Based RDF Instance Matching System

International Journal of Computer Theory and Engineering
2017English

Semantic Web Datatype Inference: Towards Better RDF Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Split4Blank: Maintaining Consistency While Improving Efficiency of Loading RDF Data With Blank Nodes

PLoS ONE
Multidisciplinary
2019English

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering
Computational MechanicsComputer Science Applications
2019English

Formal Foundations for RDF/S KB Evolution

Knowledge and Information Systems
Information SystemsHuman-Computer InteractionHardwareArchitectureArtificial IntelligenceSoftware
2012English

Sub-Optimal Graph Matching by Node-To-Node Assignment Classification

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Information Query and Integration Based on Distributed RDF(S) Model

Ruan Jian Xue Bao/Journal of Software
Software
2008English

One-To-Many Node Matching Between Complex Networks

Advances in Complex Systems
ControlSystems EngineeringMultidisciplinary
2010English

Matching Functions for Heavy Particles

Physical Review D
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy