SwetoDblp ontology of Computer Science publications
Web Semantics: Science, Services and Agents on the World Wide Web
Parallel Inferencing for OWL Knowledge Bases
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
RDFS Reasoning and Query Answering on Top of DHTs
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
Scalable Distributed Reasoning Using MapReduce
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Web Semantics: Science, Services and Agents on the World Wide Web
Mind the data skew: distributed inferencing by speeddating in elastic regions
Proceedings of the 19th international conference on World wide web
Editorial: The Semantic Web Challenge, 2009
Web Semantics: Science, Services and Agents on the World Wide Web
Signal/collect: graph algorithms for the (semantic) web
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Characterizing the semantic web on the web
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Hi-index | 0.00 |
RDFS reasoning is carried out via joint terms of triples; accordingly, a distributed reasoning approach should bring together triples that have terms in common. To achieve this, term-based partitioning distributes triples to partitions based on the terms they include. However, skewed distribution of Semantic Web data results in unbalanced load distribution. A single peer should be able to handle even the largest partition, and this requirement limits scalability. This approach also suffers from data replication since a triple is sent to multiple partitions. In this paper, we propose a two-step method to overcome above limitations. Our RDFS specific term-based partitioning algorithm applies a selective distribution policy and distributes triples with minimum replication. Our schema-sensitive processing approach eliminates non-productive partitions, and enables processing of a partition regardless of its size. Resulting partitions reach full closure without repeating the global schema or without fix-point iteration as suggested by previous studies.