Study on Data Placement Strategies in Distributed RDF Stores

Study on Data Placement Strategies in Distributed RDF Stores
Author :
Publisher : IOS Press
Total Pages : 312
Release :
ISBN-10 : 9781643680699
ISBN-13 : 1643680692
Rating : 4/5 (692 Downloads)

Book Synopsis Study on Data Placement Strategies in Distributed RDF Stores by : D.D. Janke

Download or read book Study on Data Placement Strategies in Distributed RDF Stores written by D.D. Janke and published by IOS Press. This book was released on 2020-03-18 with total page 312 pages. Available in PDF, EPUB and Kindle. Book excerpt: The distributed setting of RDF stores in the cloud poses many challenges, including how to optimize data placement on the compute nodes to improve query performance. In this book, a novel benchmarking methodology is developed for data placement strategies; one that overcomes these limitations by using a data-placement-strategy-independent distributed RDF store to analyze the effect of the data placement strategies on query performance. Frequently used data placement strategies have been evaluated, and this evaluation challenges the commonly held belief that data placement strategies which emphasize local computation lead to faster query executions. Indeed, results indicate that queries with a high workload can be executed faster on hash-based data placement strategies than on, for example, minimal edge-cut covers. The analysis of additional measurements indicates that vertical parallelization (i.e., a well-distributed workload) may be more important than horizontal containment (i.e., minimal data transport) for efficient query processing. Two such data placement strategies are proposed: the first, found in the literature, is entitled overpartitioned minimal edge-cut cover, and the second is the newly developed molecule hash cover. Evaluation revealed a balanced query workload and a high horizontal containment, which lead to a high vertical parallelization. As a result, these strategies demonstrated better query performance than other frequently used data placement strategies. The book also tests the hypothesis that collocating small connected triple sets on the same compute node while balancing the amount of triples stored on the different compute nodes leads to a high vertical parallelization.


Study on Data Placement Strategies in Distributed RDF Stores Related Books

Study on Data Placement Strategies in Distributed RDF Stores
Language: en
Pages: 312
Authors: D.D. Janke
Categories: Computers
Type: BOOK - Published: 2020-03-18 - Publisher: IOS Press

DOWNLOAD EBOOK

The distributed setting of RDF stores in the cloud poses many challenges, including how to optimize data placement on the compute nodes to improve query perform
Study on Data Placemonet Strategies in Distributed RDF Stores
Language: en
Pages:
Authors: Daniel Dominik Janke
Categories:
Type: BOOK - Published: 2020 - Publisher:

DOWNLOAD EBOOK

Big Data Analytics and Knowledge Discovery
Language: en
Pages: 323
Authors: Carlos Ordonez
Categories: Computers
Type: BOOK - Published: 2019-08-19 - Publisher: Springer

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 21st International Conference on Big Data Analytics and Knowledge Discovery, DaWaK 2019, held in Linz, Aus
Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges
Language: en
Pages: 314
Authors: I. Tiddi
Categories: Computers
Type: BOOK - Published: 2020-05-06 - Publisher: IOS Press

DOWNLOAD EBOOK

The latest advances in Artificial Intelligence and (deep) Machine Learning in particular revealed a major drawback of modern intelligent systems, namely the ina
Engineering Background Knowledge for Social Robots
Language: en
Pages: 240
Authors: L. Asprino
Categories: Computers
Type: BOOK - Published: 2020-09-25 - Publisher: IOS Press

DOWNLOAD EBOOK

Social robots are embodied agents that perform knowledge-intensive tasks involving several kinds of information from different heterogeneous sources. This book,