Work

A MapReduce Algorithm for EL

Year: 2010
Type: article
Abstract: . Recently, the use of the MapReduce framework for distribu-ted RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reason-able time span [22], and that it is also possible to carry the approach over to OWL Horst [21]. Following this lead, in this paper we provide a MapReduce algorithm for the description logic EL+, more precisely for the classification of EL+ ontologies. To do this, we first modify the algorithm usually used for EL+ classification. The modified algorithm can then be converted into a MapReduce algorithm along the same key ideas as used for RDF schema. 1
Language: English
Open Access status: green
OpenAlex ID: W2141970373
FWCI: 7.734
Cites: 23
Cited by: 45
Related to: 9