Highly Scalable Sort-merge Join Algorithm for RDF Querying

Zbyněk Falt; Miroslav Čermák; Filip Zavoral

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Highly Scalable Sort-merge Join Algorithm for RDF Querying

Topics: Database Architecture and Performance; Nosql Databases; Query Processing and Optimization

In Proceedings of the 2nd International Conference on Data Technologies and Applications DATA - Volume 1, 293-300, 2013 , Reykjavík, Iceland

Authors: Zbyněk Falt ; Miroslav Čermák and Filip Zavoral

Affiliation: Charles University, Czech Republic

Keyword(s): Merge Join, Parallel, Bobox, RDF.

Related Ontology Subjects/Areas/Topics: Data Engineering ; Database Architecture and Performance ; Databases and Data Security ; Nosql Databases ; Query Processing and Optimization

Abstract: 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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 74.48.170.251

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Falt, Z.; Čermák, M. and Zavoral, F. (2013). Highly Scalable Sort-merge Join Algorithm for RDF Querying. In Proceedings of the 2nd International Conference on Data Technologies and Applications - DATA; ISBN 978-989-8565-67-9; ISSN 2184-285X, SciTePress, pages 293-300. DOI: 10.5220/0004489702930300

@conference{data13,
author={Zbyněk Falt. and Miroslav Čermák. and Filip Zavoral.},
title={Highly Scalable Sort-merge Join Algorithm for RDF Querying},
booktitle={Proceedings of the 2nd International Conference on Data Technologies and Applications - DATA},
year={2013},
pages={293-300},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004489702930300},
isbn={978-989-8565-67-9},
issn={2184-285X},
}

TY - CONF

JO - Proceedings of the 2nd International Conference on Data Technologies and Applications - DATA
TI - Highly Scalable Sort-merge Join Algorithm for RDF Querying
SN - 978-989-8565-67-9
IS - 2184-285X
AU - Falt, Z.
AU - Čermák, M.
AU - Zavoral, F.
PY - 2013
SP - 293
EP - 300
DO - 10.5220/0004489702930300
PB - SciTePress