A framework for the parallel processing of Datalog queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
Optimized Index Structures for Querying RDF from the Web
LA-WEB '05 Proceedings of the Third Latin American Web Congress
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Theory of Computing Systems
Parallel Inferencing for OWL Knowledge Bases
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
Sindice.com: a document-oriented lookup index for open linked data
International Journal of Metadata, Semantics and Ontologies
Practical partition-based theorem proving for large knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Marvin: Distributed reasoning over large-scale Semantic Web data
Web Semantics: Science, Services and Agents on the World Wide Web
Web Semantics: Science, Services and Agents on the World Wide Web
A subscribable peer-to-peer RDF repository for distributed metadata management
Web Semantics: Science, Services and Agents on the World Wide Web
On triple dissemination, forward-chaining, and load balancing in DHT based RDF stores
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Characterizing the semantic web on the web
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
RDF packages: a scheme for efficient reasoning and querying over large-scale RDF data
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
The design and implementation of minimal RDFS backward reasoning in 4store
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Concurrent classification of EL ontologies
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Searching and browsing Linked Data with SWSE: The Semantic Web Search Engine
Web Semantics: Science, Services and Agents on the World Wide Web
WebPIE: A Web-scale Parallel Inference Engine using MapReduce
Web Semantics: Science, Services and Agents on the World Wide Web
OWL reasoning with WebPIE: calculating the closure of 100 billion triples
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part I
Where event processing grand challenge meets real-time web: PLAY event marketplace
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Replica-aided load balancing in overlay networks
Journal of Network and Computer Applications
Robust runtime optimization and skew-resistant execution of analytical SPARQL queries on pig
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
The not-so-easy task of computing class subsumptions in OWL RL
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Overcoming limitations of term-based partitioning for distributed RDFS reasoning
Proceedings of the Fifth Workshop on Semantic Web Information Management
Computing the stratified semantics of logic programs over big data through mass parallelization
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
Hi-index | 0.00 |
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such highly skewed distribution of input data. We show that term-based partitioning, used by most distributed reasoning approaches, has limited scalability due to load-balancing problems. We address this problem with a method for data distribution based on clustering in elastic regions. Instead of as- signing data to fixed peers, data flows semi-randomly in the network. Data items "speed-date" while being temporarily collocated in the same peer. We introduce a bias in the routing to allow semantically clustered neighborhoods to emerge. Our approach is self-organising, efficient and does not require any central coordination. We have implemented this method on the MaRVIN platform and have performed experiments on large real-world datasets, using a cluster of up to 64 nodes. We compute the RDFS closure over different datasets and show that our clustering algorithm drastically reduces computation time, calculating the RDFS closure of 200 million triples in 7.2 minutes.