Highly Scalable Sort-Merge Join Algorithm for RDF Querying
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10139489" target="_blank" >RIV/00216208:11320/13:10139489 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.5220/0004489702930300" target="_blank" >http://dx.doi.org/10.5220/0004489702930300</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5220/0004489702930300" target="_blank" >10.5220/0004489702930300</a>
Alternative languages
Result language
angličtina
Original language name
Highly Scalable Sort-Merge Join Algorithm for RDF Querying
Original language 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA13-08195S" target="_blank" >GA13-08195S: Highly Scalable Parallel and Distributed Methods of Data Processing in E-science</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the International Conference on Data Technologies and Applications
ISBN
978-989-8565-67-9
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
293-300
Publisher name
SciTePress
Place of publication
Portugal
Event location
Reyjkvajík, Island
Event date
Jul 29, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—