Name
Abstract | ||
|---|---|---|
Materialization is an important reasoning service for many ontology-based applications, but the rapid growth of semantic data poses the challenge to efficiently perform materialization on large-scale ontologies. Parallel materialization algorithms work well for some ontologies, although the reasoning problem for the used ontology language is not in NC, i.e., the theoretical complexity class for parallel tractability. This motivates us to study the problem of parallel tractability of ontology materialization from a theoretical perspective. We focus on the datalog rewritable ontology languages DL-Lite and Description Horn Logic (DHL) and propose algorithms, called NC algorithms, to identify classes of ontologies for which materialization is tractable in parallel. To verify the practical usability of the above results, we analyze different benchmarks and real-world datasets, including LUBM and the YAGO ontology, and show that for many ontologies expressed in DHL materialization is tractable in parallel. The implementation of our optimized parallel algorithm shows performance improvements over the highly optimized state-of-the-art reasoner RDFox on ontologies for which materialization is tractable in parallel. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.websem.2018.09.005 | Journal of Web Semantics |
Keywords | Field | DocType |
Ontology,Materialization,Datalog,Parallel tractability,NC complexity | Ontology (information science),Ontology,Semantic reasoner,Information retrieval,Parallel algorithm,Computer science,Usability,Theoretical computer science,Datalog,Semantic data model,Ontology language | Journal |
Volume | ISSN | Citations |
52 | 1570-8268 | 0 |
PageRank | References | Authors |
0.34 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhangquan Zhou | 1 | 19 | 3.40 |
| Guilin Qi | 2 | 961 | 88.58 |
| Birte Glimm | 3 | 753 | 54.50 |