Ontology type: schema:Chapter Open Access: True
2021-05-31
AUTHORSTemitope Ajileye , Boris Motik , Ian Horrocks
ABSTRACTA cluster of servers is often used to reason over RDF graphs whose size exceeds the capacity of a single server. While many distributed approaches to reasoning have been proposed, the problem of data partitioning has received little attention thus far. In practice, data is usually partitioned by a variant of hashing, which is very simple, but it does not pay attention to data locality. Locality-aware partitioning approaches have been considered, but they usually process the entire dataset on a single server. In this paper, we present two new RDF partitioning strategies. Both are inspired by recent streaming graph partitioning algorithms, which partition a graph while keeping only a small subset of the graph in memory. We have evaluated our approaches empirically against hash and min-cut partitioning. Our results suggest that our approaches can significantly improve reasoning performance, but without unrealistic demands on the memory of the servers used for partitioning. More... »
PAGES3-22
The Semantic Web
ISBN
978-3-030-77384-7
978-3-030-77385-4
http://scigraph.springernature.com/pub.10.1007/978-3-030-77385-4_1
DOIhttp://dx.doi.org/10.1007/978-3-030-77385-4_1
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1138468547
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0803",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computer Software",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Department of Computer Science, University of Oxford, Oxford, UK",
"id": "http://www.grid.ac/institutes/grid.4991.5",
"name": [
"Department of Computer Science, University of Oxford, Oxford, UK"
],
"type": "Organization"
},
"familyName": "Ajileye",
"givenName": "Temitope",
"id": "sg:person.010564701705.97",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010564701705.97"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, University of Oxford, Oxford, UK",
"id": "http://www.grid.ac/institutes/grid.4991.5",
"name": [
"Department of Computer Science, University of Oxford, Oxford, UK"
],
"type": "Organization"
},
"familyName": "Motik",
"givenName": "Boris",
"id": "sg:person.07401076267.36",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07401076267.36"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Department of Computer Science, University of Oxford, Oxford, UK",
"id": "http://www.grid.ac/institutes/grid.4991.5",
"name": [
"Department of Computer Science, University of Oxford, Oxford, UK"
],
"type": "Organization"
},
"familyName": "Horrocks",
"givenName": "Ian",
"id": "sg:person.013100561643.19",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013100561643.19"
],
"type": "Person"
}
],
"datePublished": "2021-05-31",
"datePublishedReg": "2021-05-31",
"description": "A cluster of servers is often used to reason over RDF graphs whose size exceeds the capacity of a single server. While many distributed approaches to reasoning have been proposed, the problem of data partitioning has received little attention thus far. In practice, data is usually partitioned by a variant of hashing, which is very simple, but it does not pay attention to data locality. Locality-aware partitioning approaches have been considered, but they usually process the entire dataset on a single server. In this paper, we present two new RDF partitioning strategies. Both are inspired by recent streaming graph partitioning algorithms, which partition a graph while keeping only a small subset of the graph in memory. We have evaluated our approaches empirically against hash and min-cut partitioning. Our results suggest that our approaches can significantly improve reasoning performance, but without unrealistic demands on the memory of the servers used for partitioning.",
"editor": [
{
"familyName": "Verborgh",
"givenName": "Ruben",
"type": "Person"
},
{
"familyName": "Hose",
"givenName": "Katja",
"type": "Person"
},
{
"familyName": "Paulheim",
"givenName": "Heiko",
"type": "Person"
},
{
"familyName": "Champin",
"givenName": "Pierre-Antoine",
"type": "Person"
},
{
"familyName": "Maleshkova",
"givenName": "Maria",
"type": "Person"
},
{
"familyName": "Corcho",
"givenName": "Oscar",
"type": "Person"
},
{
"familyName": "Ristoski",
"givenName": "Petar",
"type": "Person"
},
{
"familyName": "Alam",
"givenName": "Mehwish",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-030-77385-4_1",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-030-77384-7",
"978-3-030-77385-4"
],
"name": "The Semantic Web",
"type": "Book"
},
"keywords": [
"RDF graphs",
"single server",
"cluster of servers",
"Datalog reasoning",
"data partitioning",
"data locality",
"server",
"partitioning strategies",
"partitioning approach",
"entire dataset",
"graph",
"reasoning",
"hashing",
"hash",
"small subset",
"partitioning",
"dataset",
"algorithm",
"memory",
"unrealistic demands",
"performance",
"demand",
"attention",
"little attention",
"clusters",
"data",
"subset",
"localities",
"strategies",
"results",
"variants",
"practice",
"size",
"capacity",
"approach",
"min",
"paper",
"problem"
],
"name": "Streaming Partitioning of RDF Graphs for Datalog Reasoning",
"pagination": "3-22",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1138468547"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-030-77385-4_1"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-030-77385-4_1",
"https://app.dimensions.ai/details/publication/pub.1138468547"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:47",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_366.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-030-77385-4_1"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-77385-4_1'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-77385-4_1'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-77385-4_1'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-030-77385-4_1'
This table displays all metadata directly associated to this object as RDF triples.
147 TRIPLES
23 PREDICATES
63 URIs
56 LITERALS
7 BLANK NODES