The Community for Technology Leaders
Green Image
Issue No. 02 - March-April (2013 vol. 17)
ISSN: 1089-7801
pp: 52-61
Kemafor Anyanwu , North Carolina State University
HyeongSik Kim , North Carolina State University
Padmashree Ravindra , North Carolina State University
ABSTRACT
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 TripleGroup Data Model and Algebra (NTGA) that minimizes overall processing costs by reducing the number of MapReduce 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.
INDEX TERMS
Resource description framework, Optimization, Query processing, Data processing, query processing, query languages, database management, information technology and systems
CITATION

P. Ravindra, H. Kim and K. Anyanwu, "Algebraic Optimization for Processing Graph Pattern Queries in the Cloud," in IEEE Internet Computing, vol. 17, no. , pp. 52-61, 2013.
doi:10.1109/MIC.2012.22
291 ms
(Ver 3.3 (11022016))