.png){kind=icon}
返回
Algebraic Optimization for Processing Graph Pattern Queries in the Cloud
.png){kind=icon}
PRE
AI
DOI：10.1109/MIC.2012.22.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
MapReduce platforms such as Hadoop are now the de facto standard for large-scale data processing, but they have significant limitations for join-intensive workloads typical in Semantic Web processing. This article overviews an algebraic optimization approach based on a Nested Triple Group Data Model and Algebra (NTGA) that minimizes overall processing costs by reducing the number of Map Reduce cycles. It also presents an approach for integrating NTGA-based processing of graph pattern queries into Apache Pig and compares it to execution plans using relational-style algebra operators.
Keyword:
SPARQL
期刊
IF:
4.4
论文数:
2.0K
被引数:
2.0K
机构
.png){kind=icon}
没有更多内容