41 citations · 87 across the 6 of their papers we have counts for
7 papers · 1 filter
PRoST: Distributed Execution of SPARQL Queries Using Mixed Partitioning Strategies
Matteo Cossu, Michael Färber, Georg Lausen
The rapidly growing size of RDF graphs in recent years necessitates distributed storage and parallel processing strategies. To obtain efficient query processing using computer clus…
S2RDF: RDF Querying with SPARQL on Spark
Alexander Schätzle, Martin Przyjaciel-Zablocki, Simon Skilevic +1
RDF has become very popular for semantic data publishing due to its flexible and universal graph-like data model. Yet, the ever-increasing size of RDF data collections makes it mor…
Pleasantly Consuming Linked Data with RDF Data Descriptions
Michael Schmidt, Georg Lausen
Although the intention of RDF is to provide an open, minimally constraining way for representing information, there exists an increasing number of applications for which guarantees…
Cascading map-side joins over HBase for scalable join processing
Martin Przyjaciel-Zablocki, Alexander Schätzle, Thomas Hornung +2
One of the major challenges in large-scale data processing with MapReduce is the smart computation of joins. Since Semantic Web datasets published in RDF have increased rapidly ove…
On Chase Termination Beyond Stratification
Michael Meier, Michael Schmidt, Georg Lausen
We study the termination problem of the chase algorithm, a central tool in various database problems such as the constraint implication problem, Conjunctive Query optimization, rew…
Stop the Chase
Michael Meier, Michael Schmidt, Georg Lausen
The chase procedure, an algorithm proposed 25+ years ago to fix constraint violations in database instances, has been successfully applied in a variety of contexts, such as query o…