{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:02:48Z","timestamp":1781103768949,"version":"3.54.1"},"reference-count":30,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,1,1]]},"abstract":"<p>Graph and semi-structured data are usually modeled in relational processing frameworks as \u201cthin\u201d relations (node, edge, node) and processing such data involves a lot of join operations. Intermediate results of joins with multi-valued attributes or relationships, contain redundant subtuples due to repetition of single-valued attributes. The amount of redundant content is high for real-world multi-valued relationships in social network (millions of Twitter followers of popular celebrities) or biological (multiple references to related proteins) datasets. In MapReduce-based platforms such as Apache Hive and Pig, redundancy in intermediate results contributes avoidable costs to the overall I\/O, sorting, and network transfer overhead of join-intensive workloads due to longer workflows. Consequently, providing techniques for dealing with such redundancy will enable more nimble execution of such workflows. This paper argues for the use of a nested data model for representing intermediate data concisely using nesting-aware dataflow operators that allow for lazy and partial unnesting strategies. This approach reduces the overall I\/O and network footprint of a workflow by concisely representing intermediate results during most of a workflow's execution, until complete unnesting is absolutely necessary. The proposed strategies are integrated into Apache Pig and experimental evaluation over real-world and synthetic benchmark datasets confirms their superiority over relational-style MapReduce systems such as Apache Pig and Hive.<\/p>","DOI":"10.4018\/ijswis.2014010101","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T08:58:54Z","timestamp":1409648334000},"page":"1-26","source":"Crossref","is-referenced-by-count":7,"title":["Nesting Strategies for Enabling Nimble MapReduce Dataflows for Large RDF Data"],"prefix":"10.4018","volume":"10","author":[{"given":"Padmashree","family":"Ravindra","sequence":"first","affiliation":[{"name":"Department of Computer Science, North Carolina State University, Raleigh, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kemafor","family":"Anyanwu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, North Carolina State University, Raleigh, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijswis.2014010101-0","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51171-7_23"},{"key":"ijswis.2014010101-1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687731"},{"key":"ijswis.2014010101-2","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739056"},{"key":"ijswis.2014010101-3","doi-asserted-by":"crossref","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., & Ives, Z. (2007). Dbpedia: A nucleus for a web of open data. The Semantic Web, 722\u2013735.","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"ijswis.2014010101-4","unstructured":"Bialecki, A., Cafarella, M., Cutting, D., & O\u2019Malley, O. (2005). Hadoop: A framework for running applications on large clusters built of commodity hardware. Retrieved from http:\/\/lucene.apache.org\/hadoop"},{"key":"ijswis.2014010101-5","doi-asserted-by":"publisher","DOI":"10.4018\/jswis.2009040101"},{"key":"ijswis.2014010101-6","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ijswis.2014010101-7","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920908"},{"key":"ijswis.2014010101-8","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168659"},{"key":"ijswis.2014010101-9","first-page":"386","article-title":"Evaluation of main memory join algorithms for joins with set comparison join predicates.","volume":"97","author":"S.Helmer","year":"1997","journal-title":"VLDB"},{"issue":"11","key":"ijswis.2014010101-10","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.14778\/3402707.3402747","article-title":"Scalable Sparql querying of large RDF graphs.","volume":"4","author":"J.Huang","year":"2011","journal-title":"Proceedings of the VLDB Endowment"},{"key":"ijswis.2014010101-11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.103"},{"key":"ijswis.2014010101-12","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"issue":"12","key":"ijswis.2014010101-13","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.14778\/3402755.3402787","article-title":"From Sparql to Mapreduce: The journey using a nested Triplegroup algebra.","volume":"4","author":"H.Kim","year":"2011","journal-title":"Proceedings of the VLDB Endowment"},{"key":"ijswis.2014010101-14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.156"},{"key":"ijswis.2014010101-15","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872778"},{"key":"ijswis.2014010101-16","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2002.1067737"},{"key":"ijswis.2014010101-17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767884"},{"key":"ijswis.2014010101-18","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920906"},{"key":"ijswis.2014010101-19","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989439"},{"key":"ijswis.2014010101-20","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"ijswis.2014010101-21","unstructured":"Prud\u2019hommeaux, E., & Seaborne, A. (2010). SPARQL query language for RDF, W3C Recommendation. Retrieved from http:\/\/www.w3.org\/TR\/rdf-sparql-query"},{"key":"ijswis.2014010101-22","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391233"},{"key":"ijswis.2014010101-23","doi-asserted-by":"crossref","unstructured":"Ravindra, P., Kim, H., & Anyanwu, K. (2011). An intermediate algebra for optimizing RDF graph pattern matching on MapReduce. The Semantic Web: Research and Applications, 46\u201361.","DOI":"10.1007\/978-3-642-21064-8_4"},{"key":"ijswis.2014010101-24","doi-asserted-by":"publisher","DOI":"10.1145\/2237867.2237872"},{"key":"ijswis.2014010101-25","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.230"},{"key":"ijswis.2014010101-26","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"ijswis.2014010101-27","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"ijswis.2014010101-28","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038927"},{"key":"ijswis.2014010101-29","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038928"}],"container-title":["International Journal on Semantic Web and Information Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=113712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T18:08:31Z","timestamp":1654106911000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijswis.2014010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijswis.2014010101","relation":{},"ISSN":["1552-6283","1552-6291"],"issn-type":[{"value":"1552-6283","type":"print"},{"value":"1552-6291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}