01195nas a2200193 4500008004100000245003400041210003100075260004300106300001200149490000800161520066300169100002300832700002100855700002000876700002100896700001700917700002300934856004400957 2010 eng d00aA MapReduce Algorithm for EL+0 aMapReduce Algorithm for EL aWaterloo, Ontario, CanadabCEUR-WS.org a464-4740 v5733 a
Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reasonable 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 aMutharaju, Raghava1 aMaier, Frederick1 aHitzler, Pascal1 aHaarslev, Volker1 aToman, David1 aWeddell, Grant, E. uhttp://ceur-ws.org/Vol-573/paper_35.pdf