.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
SPARQL
Journal
IF:
4.4
Papers:
2.0K
Citations:
2.0K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
no more
no more