Simple and efficient minimal RDFS

S Munoz, J Pérez, C Gutierrez - Journal of web semantics, 2009 - Elsevier
… work as an essential minimal and efficient floor from where to … minimal fragment. This
result is also the theoretical basis of why we consider only ground triples in the minimal RDFS

RDFRules: Making RDF rule mining easier and even more efficient

V Zeman, T Kliegr, V Svátek - Semantic web, 2021 - content.iospress.com
AMIE+ is a state-of-the-art algorithm for learning rules from RDF knowledge graphs (KGs).
Based on association rule learning, AMIE+ constituted a breakthrough in terms of speed on …

Minimal deductive systems for RDF

S Munoz, J Pérez, C Gutiérrez - European Semantic Web Conference, 2007 - Springer
… We present here a single notion of interpretation which summarizes Simple, RDF, and
RDFS interpretations in one step, and which will be used later to define the semantics of our …

Effective and efficient entity search in RDF data

R Blanco, P Mika, S Vigna - The Semantic Web–ISWC 2011: 10th …, 2011 - Springer
… At the same time, the Semantic Web is increasingly reaching end users who need
efficient and effective access to large subsets of this data. Such end users prefer simple, but …

Canonical forms for isomorphic and equivalent RDF graphs: algorithms for leaning and labelling blank nodes

A Hogan - ACM Transactions on the Web (TWEB), 2017 - dl.acm.org
… In this article, we are interested in the simple semantics, which codifies a meaning for RDF
graphs without considering the interpretation of datatype values or special vocabulary terms (…

DREAM: distributed RDF engine with adaptive query planner and minimal communication

M Hammoud, DA Rabbou, R Nouri… - Proceedings of the …, 2015 - dl.acm.org
… two problems and attain minimal intermediate data communication. A simple and effective
… 2) offer a one-size-fits-all paradigm for all sorts of SPARQL queries (eg, simple and complex …

TripleBit: a fast and compact system for large scale RDF data

P Yuan, P Liu, B Wu, H Jin, W Zhang, L Liu - Proceedings of the VLDB …, 2013 - dl.acm.org
… First, it is important to design an RDF data storage structure that can directly and efficiently
… Second, in order to truly scale the RDF query processor, we need efficient index structures …

[PDF][PDF] Efficient RDF Storage and Retrieval in Jena2.

K Wilkinson, C Sayers, HA Kuno, D Reynolds - SWDB, 2003 - Citeseer
RDF resources to be analogous to objects, RDF properties to represent attributes, and RDF
… In this section, we discuss two simple cases and mention the difficulties for the general case…

Scalable SPARQL querying of large RDF graphs

J Huang, DJ Abadi, K Ren - Proceedings of the VLDB Endowment, 2011 - dl.acm.org
RDF data management system that is up to three orders of magnitude more efficient than
popular multi-node RDF data … raph partition RDF data across machines instead of simple hash …

Scaling RDF with time

A Pugliese, O Udrea, VS Subrahmanian - Proceedings of the 17th …, 2008 - dl.acm.org
RDF index designed especially for such queries, most RDF storage systems to date such as
Jena, Sesame, RDFsimple query patterns, and six to ten times faster for complex queries. …