Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Blank node"'
Publikováno v:
Journal of King Saud University - Computer and Information Sciences. 34:7604-7620
This paper details RDF/OWL storage and management in two popular Relational Database Management Systems (RDBMSs): Oracle and Virtuoso. Popularity, sustainability, and conformance with the SPARQL language are the main reasons for choosing these system
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dominik Tomaszuk, David Hyland-Wood
Publikováno v:
Symmetry, Vol 12, Iss 1, p 84 (2020)
Resource Description Framework (RDF) can seen as a solution in today’s landscape of knowledge representation research. An RDF language has symmetrical features because subjects and objects in triples can be interchangeably used. Moreover, the regul
Externí odkaz:
https://doaj.org/article/3963480e20a340319c391ab3d8c9475e
Publikováno v:
Programming and Computer Software. 46:384-396
The problem of lazy visualization of ontological graphs has certain constraints. Visualization of structures that contain blank nodes is especially challenging. In this paper, we propose an approach to visualization of these structures that is implem
Autor:
Frommhold, Marvin, Navarro Piris, Rubén, Arndt, Natanael, Tramp, Sebastian, Petersen, Niklas, Martin, Michael
Coherent and consistent tracking of provenance data and in particular update history information is a crucial building block for any serious information system architecture. Version Control Systems can be a part of such an architecture enabling users
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A15777
https://ul.qucosa.de/api/qucosa%3A15777/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A15777/attachment/ATT-0/
Autor:
Aidan Hogan
Publikováno v:
ACM Transactions on the Web. 11:1-62
Existential blank nodes greatly complicate a number of fundamental operations on Resource Description Framework (RDF) graphs. In particular, the problems of determining if two RDF graphs have the same structure modulo blank node labels (i.e., if they
Autor:
M. Tamer Özsu, Lei Zou
Publikováno v:
Data Science and Engineering. 2:56-70
The increasing size of RDF data requires efficient systems to store and query them. There have been efforts to map RDF data to a relational representation, and a number of systems exist that follow this approach. We have been investigating an alterna
Publikováno v:
WCSP
The blockchain provides an immutable, transparent, and decentralized method for data storage. However, as the volume of data gradually increases, the public blockchain system requires significant storage space. Also the synchronization of blank nodes
Publikováno v:
Computer Science and Information Systems. 14:347-367
Nowadays, many applications use spatial data for instance-location information, so storing spatial data is important.We suggest using R -Tree over PCM. Our objective is to design a PCM-sensitive R -Tree that can store spatial data as well as improve
Publikováno v:
Knowledge and Information Systems. 50:505-542
In the linked open data cloud, the biggest open data graph that currently exists, a remarkable percentage of data are unnamed resources, also called blank nodes. Several fundamental tasks, such as graph isomorphism checking and RDF data versioning, r