Tree structure for expressive MapReduce framework

Nathar Shah; Chris Messom

doi:10.1145/3178212.3178236

Tree structure for expressive MapReduce framework

Nathar Shah, Chris Messom

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

Abstract

The traditional MapReduce paradigm lacks in expressivity. However it is popular for its fault-tolerance, automatic parallelism, and the ease of distributed computing. Our work aims to tackle this by introducing an expressive MapReduce framework. Expressivity has its theoretical foundations in description logics. Itallows for reasoning tasks such as subsumption. We have picked description logic EL+ for the expressivity due to its feasible computational complexity. In this work we will show how a tree structure be used as the basis for expressive EL+ MapReduce. Trees will be pruned to sub-trees and re-assembled in parallel and distributed MapReduce framework. As a result, large scale linked data reasoning on MapReduce framework would be possible in the expressive MapReduce framework.

Original language	English
Title of host publication	2017 International Conference on Software and e-Business (ICSEB 2017)
Subtitle of host publication	December 28-30, 2017 Hong Kong
Editors	Shuanghua Yang
Place of Publication	New York NY USA
Publisher	Association for Computing Machinery (ACM)
Pages	33-37
Number of pages	5
ISBN (Electronic)	9781450354882
DOIs	https://doi.org/10.1145/3178212.3178236
Publication status	Published - 2017
Event	International Conference on Software and e-Business 2017 - Hong Kong, Hong Kong Duration: 28 Dec 2017 → 30 Dec 2017 https://web.archive.org/web/20170524060909/http://www.icseb.org/

Conference

Conference	International Conference on Software and e-Business 2017
Abbreviated title	ICSEB 2017
Country/Territory	Hong Kong
City	Hong Kong
Period	28/12/17 → 30/12/17
Internet address	https://web.archive.org/web/20170524060909/http://www.icseb.org/

Keywords

Big data
Description logic
MapReduce
Tree structure

Access to Document

10.1145/3178212.3178236

Cite this

@inproceedings{e270fdbcf2a9453fbe7b881492f1cc7e,

title = "Tree structure for expressive MapReduce framework",

abstract = "The traditional MapReduce paradigm lacks in expressivity. However it is popular for its fault-tolerance, automatic parallelism, and the ease of distributed computing. Our work aims to tackle this by introducing an expressive MapReduce framework. Expressivity has its theoretical foundations in description logics. Itallows for reasoning tasks such as subsumption. We have picked description logic EL+ for the expressivity due to its feasible computational complexity. In this work we will show how a tree structure be used as the basis for expressive EL+ MapReduce. Trees will be pruned to sub-trees and re-assembled in parallel and distributed MapReduce framework. As a result, large scale linked data reasoning on MapReduce framework would be possible in the expressive MapReduce framework.",

keywords = "Big data, Description logic, MapReduce, Tree structure",

author = "Nathar Shah and Chris Messom",

year = "2017",

doi = "10.1145/3178212.3178236",

language = "English",

pages = "33--37",

editor = "Yang, {Shuanghua }",

booktitle = "2017 International Conference on Software and e-Business (ICSEB 2017)",

publisher = "Association for Computing Machinery (ACM)",

address = "United States of America",

note = "International Conference on Software and e-Business 2017, ICSEB 2017 ; Conference date: 28-12-2017 Through 30-12-2017",

url = "https://web.archive.org/web/20170524060909/http://www.icseb.org/",

}

Shah, N & Messom, C 2017, Tree structure for expressive MapReduce framework. in S Yang (ed.), 2017 International Conference on Software and e-Business (ICSEB 2017): December 28-30, 2017 Hong Kong. Association for Computing Machinery (ACM), New York NY USA, pp. 33-37, International Conference on Software and e-Business 2017, Hong Kong, Hong Kong, 28/12/17. https://doi.org/10.1145/3178212.3178236

Tree structure for expressive MapReduce framework. / Shah, Nathar; Messom, Chris.

2017 International Conference on Software and e-Business (ICSEB 2017): December 28-30, 2017 Hong Kong. ed. / Shuanghua Yang. New York NY USA : Association for Computing Machinery (ACM), 2017. p. 33-37.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

TY - GEN

T1 - Tree structure for expressive MapReduce framework

AU - Shah, Nathar

AU - Messom, Chris

PY - 2017

Y1 - 2017

N2 - The traditional MapReduce paradigm lacks in expressivity. However it is popular for its fault-tolerance, automatic parallelism, and the ease of distributed computing. Our work aims to tackle this by introducing an expressive MapReduce framework. Expressivity has its theoretical foundations in description logics. Itallows for reasoning tasks such as subsumption. We have picked description logic EL+ for the expressivity due to its feasible computational complexity. In this work we will show how a tree structure be used as the basis for expressive EL+ MapReduce. Trees will be pruned to sub-trees and re-assembled in parallel and distributed MapReduce framework. As a result, large scale linked data reasoning on MapReduce framework would be possible in the expressive MapReduce framework.

AB - The traditional MapReduce paradigm lacks in expressivity. However it is popular for its fault-tolerance, automatic parallelism, and the ease of distributed computing. Our work aims to tackle this by introducing an expressive MapReduce framework. Expressivity has its theoretical foundations in description logics. Itallows for reasoning tasks such as subsumption. We have picked description logic EL+ for the expressivity due to its feasible computational complexity. In this work we will show how a tree structure be used as the basis for expressive EL+ MapReduce. Trees will be pruned to sub-trees and re-assembled in parallel and distributed MapReduce framework. As a result, large scale linked data reasoning on MapReduce framework would be possible in the expressive MapReduce framework.

KW - Big data

KW - Description logic

KW - MapReduce

KW - Tree structure

UR - http://www.scopus.com/inward/record.url?scp=85045938698&partnerID=8YFLogxK

U2 - 10.1145/3178212.3178236

DO - 10.1145/3178212.3178236

M3 - Conference Paper

AN - SCOPUS:85045938698

SP - 33

EP - 37

BT - 2017 International Conference on Software and e-Business (ICSEB 2017)

A2 - Yang, Shuanghua

PB - Association for Computing Machinery (ACM)

CY - New York NY USA

T2 - International Conference on Software and e-Business 2017

Y2 - 28 December 2017 through 30 December 2017

ER -

Tree structure for expressive MapReduce framework

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this