Study On Data Placement Strategies In Distributed Rdf Stores


Download Study On Data Placement Strategies In Distributed Rdf Stores PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Study On Data Placement Strategies In Distributed Rdf Stores book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

Study on Data Placement Strategies in Distributed RDF Stores


Study on Data Placement Strategies in Distributed RDF Stores

Author: D.D. Janke

language: en

Publisher: IOS Press

Release Date: 2020-03-18


DOWNLOAD





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 Placemonet Strategies in Distributed RDF Stores


Study on Data Placemonet Strategies in Distributed RDF Stores

Author: Daniel Dominik Janke

language: en

Publisher:

Release Date: 2020


DOWNLOAD





Big Data Analytics and Knowledge Discovery


Big Data Analytics and Knowledge Discovery

Author: Carlos Ordonez

language: en

Publisher: Springer

Release Date: 2019-08-19


DOWNLOAD





This book constitutes the refereed proceedings of the 21st International Conference on Big Data Analytics and Knowledge Discovery, DaWaK 2019, held in Linz, Austria, in September 2019. The 12 full papers and 10 short papers presented were carefully reviewed and selected from 61 submissions. The papers are organized in the following topical sections: Applications; patterns; RDF and streams; big data systems; graphs and machine learning; databases.