This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n7http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n6http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/projekt/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/subjekt/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F13%3A10139489%21RIV14-GA0-11320___/
n4http://linked.opendata.cz/ontology/domain/vavai/
n15https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n10http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F13%3A10139489%21RIV14-GA0-11320___
rdf:type
skos:Concept n4:Vysledek
dcterms:description
In this paper, we introduce a highly scalable sort-merge join algorithm for RDF databases. The algorithm is designed especially for streaming systems; besides task and data parallelism, it also tries to exploit the pipeline parallelism in order to increase its scalability. Additionally, we focused on handling skewed data correctly and efficiently; the algorithm scales well regardless of the data distribution. In this paper, we introduce a highly scalable sort-merge join algorithm for RDF databases. The algorithm is designed especially for streaming systems; besides task and data parallelism, it also tries to exploit the pipeline parallelism in order to increase its scalability. Additionally, we focused on handling skewed data correctly and efficiently; the algorithm scales well regardless of the data distribution.
dcterms:title
Highly Scalable Sort-Merge Join Algorithm for RDF Querying Highly Scalable Sort-Merge Join Algorithm for RDF Querying
skos:prefLabel
Highly Scalable Sort-Merge Join Algorithm for RDF Querying Highly Scalable Sort-Merge Join Algorithm for RDF Querying
skos:notation
RIV/00216208:11320/13:10139489!RIV14-GA0-11320___
n4:predkladatel
n5:orjk%3A11320
n3:aktivita
n8:S n8:P
n3:aktivity
P(GA13-08195S), S
n3:dodaniDat
n16:2014
n3:domaciTvurceVysledku
n12:8374570 n12:2841258 n12:3100707
n3:druhVysledku
n14:D
n3:duvernostUdaju
n22:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
77407
n3:idVysledku
RIV/00216208:11320/13:10139489
n3:jazykVysledku
n17:eng
n3:klicovaSlova
RDF; BOBOX; PARALLEL; MERGE JOIN
n3:klicoveSlovo
n9:RDF n9:MERGE%20JOIN n9:PARALLEL n9:BOBOX
n3:kontrolniKodProRIV
[F81DDA09F198]
n3:mistoKonaniAkce
Reyjkvajík, Island
n3:mistoVydani
Portugal
n3:nazevZdroje
Proceedings of the International Conference on Data Technologies and Applications
n3:obor
n20:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n21:GA13-08195S
n3:rokUplatneniVysledku
n16:2013
n3:tvurceVysledku
Falt, Zbyněk Čermák, Miroslav Zavoral, Filip
n3:typAkce
n7:WRD
n3:zahajeniAkce
2013-07-29+02:00
s:numberOfPages
8
n10:doi
10.5220/0004489702930300
n6:hasPublisher
SciTePress
n15:isbn
978-989-8565-67-9
n19:organizacniJednotka
11320