Name
Abstract | ||
|---|---|---|
We investigate a new approach to the design of distributed, shared-nothing RDF engines. Our engine, coined \"TriAD\", combines join-ahead pruning via a novel form of RDF graph summarization with a locality-based, horizontal partitioning of RDF triples into a grid-like, distributed index structure. The multi-threaded and distributed execution of joins in TriAD is facilitated by an asynchronous Message Passing protocol which allows us to run multiple join operators along a query plan in a fully parallel, asynchronous fashion. We believe that our architecture provides a so far unique approach to join-ahead pruning in a distributed environment, as the more classical form of sideways information passing would not permit for executing distributed joins in an asynchronous way. Our experiments over the LUBM, BTC and WSDTS benchmarks demonstrate that TriAD consistently outperforms centralized RDF engines by up to two orders of magnitude, while gaining a factor of more than three compared to the currently fastest, distributed engines. To our knowledge, we are thus able to report the so far fastest query response times for the above benchmarks using a mid-range server and regular Ethernet setup. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2588555.2610511 | SIGMOD Conference |
Keywords | Field | DocType |
distributed rdf indexing & sparql processing,asynchronous message passing,join-ahead pruning,parallel join evaluation,distributed databases,query processing | Automatic summarization,Asynchronous communication,Joins,Distributed Computing Environment,Computer science,Shared nothing architecture,RDF,Message passing,Database,Query plan,Distributed computing | Conference |
Citations | PageRank | References |
77 | 1.74 | 28 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sairam Gurajada | 1 | 118 | 7.83 |
| Stephan Seufert | 2 | 279 | 10.69 |
| Iris Miliaraki | 3 | 237 | 10.40 |
| Martin Theobald | 4 | 1474 | 72.06 |