z-logo
open-access-imgOpen Access
On the Feasibility of Handling Uncertainty in SPARQL Queries in the Case of Sparse Graphs
Author(s) -
Theodore Andronikos
Publication year - 2020
Publication title -
international journal of innovative research in computer science and technology
Language(s) - English
Resource type - Journals
ISSN - 2347-5552
DOI - 10.21276/ijircst.2020.8.6.5
Subject(s) - computer science , sparql , probabilistic logic , theoretical computer science , sparse matrix , transitive relation , named graph , succinctness , rdf , information retrieval , data mining , semantic web , artificial intelligence , mathematics , physics , quantum mechanics , combinatorics , gaussian

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom