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 | |
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 |
Keywords
- Big data
- Description logic
- MapReduce
- Tree structure