20 March 2013 Scalable distributed RDFS reasoning using MapReduce and Bigtable
Author Affiliations +
Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87680Z (2013) https://doi.org/10.1117/12.2010731
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore
Abstract
The reasoning over massive RDF data has a great advancement in last few years. Many methods have been proposed in past several years, including the method with MapReduce. But the current MapReduce approach contains four reasoning steps and avoids data duplication by special data processing and partitioning. Our work is to propose an algorithm for RDFS reasoning with MapReduce and Bigtable. Through the optimization of RDFS rules’ applying sequence in map and reduce methods, our approach can complete RDFS closure reasoning without special data preprocessing and partitioning in only one MapReduce reasoning step. We have implemented our method on Hadoop and HBase with 3 nodes. We compute the RDFS closure over different datasets and our practice enjoys faster speed and better speedup, calculating RDFS closure of 260 million triples in 50 minutes, about 15 minutes faster than WebPIE.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Huijun Shi, Huijun Shi, Ruonan Rao , Ruonan Rao , } "Scalable distributed RDFS reasoning using MapReduce and Bigtable", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680Z (20 March 2013); doi: 10.1117/12.2010731; https://doi.org/10.1117/12.2010731
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT


Back to Top