Name
Abstract | ||
|---|---|---|
When RDF datasets become too large to be managed by centralised systems, they are often distributed in a cluster of shared-nothing servers, and queries are answered using a distributed join algorithm. Although such solutions have been extensively studied in relational and RDF databases, we argue that existing approaches exhibit two drawbacks. First, they usually decide statically(i.e., at query co... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TKDE.2018.2818696 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | Field | DocType |
Servers,Resource description framework,Query processing,Heuristic algorithms,Partitioning algorithms,Query processing | Data mining,Computer science,Compile time,Server,Theoretical computer science,Dynamic Data Exchange,Graph partition,RDF,Bounded function,Bounding overwatch,Computation | Journal |
Volume | Issue | ISSN |
30 | 12 | 1041-4347 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony Potter | 1 | 8 | 1.18 |
| Boris Motik | 2 | 4092 | 250.58 |
| Yavor Nenov | 3 | 118 | 11.24 |
| Ian Horrocks | 4 | 11731 | 1086.65 |