1 option
Study on data placement strategies in distributed RDF stores / Daniel Dominik Janke.
- Format:
- Book
- Author/Creator:
- Janke, Daniel Dominik, author.
- Series:
- Studies on the Semantic Web ; Volume 46.
- Studies on the Semantic Web ; Volume 46
- Language:
- English
- Subjects (All):
- Electronic data processing--Distributed processing.
- Electronic data processing.
- Physical Description:
- 1 online resource (312 pages).
- Edition:
- 1st ed.
- Place of Publication:
- Berlin ; Amsterdam, The Netherlands : IOS Press : AKA, [2020]
- Summary:
- 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.
- Contents:
- Intro
- Title Page
- Contents
- Introduction
- Research Questions
- Research Contributions
- Foundations
- Formalization of Graph Cover Strategies and SPARQL
- Architectures
- Indices
- Distributed Query Processing Strategies
- Fault Tolerance
- Further Challenges
- Related Work
- Graph Cover Strategies
- Evaluation Methodologies
- Methodology for Benchmarking Graph Cover Strategies
- Evaluation Measures
- Data Set and Queries
- Query Execution Strategies
- Distributed RDF Store for Arbitrary Graph Covers
- Evaluation of Common Graph Cover Strategies
- Experimental Setup
- Results
- Lessons Learned
- Discussion
- Combining the Benefits of Graph Clustering and Hash Partitioning
- Proposed Graph Cover Strategies
- Conclusion
- Distributed Query Execution Examples
- Example of Query Execution without Replication
- Example of Query Execution with Replication
- Proof of Semantic Correctness and Completeness of Koral's Distributed Query Execution Strategy
- Proof of Semantic Correctness and Completeness for the Distributed Query Execution Strategy Ignoring Triple Replication
- Proof of Knows Lemma
- Proof of Semantic Correctness and Completeness for the Distributed Query Execution Strategy With Triple Replication
- Proof of Unique Knows Theorem
- Proof of Similarity of the Replication-Aware Extension
- Additional Evaluation Details
- Characteristics of the Used Data Sets
- Generated Queries
- Query Execution Times
- Bibliography.
- Notes:
- Includes bibliographical references.
- Description based on print version record.
- Description based on publisher supplied metadata and other sources.
- ISBN:
- 1-64368-069-2
- OCLC:
- 1155320937
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.