Maintaining order in a generalized linked list
Acta Informatica
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The chatty web: emergent semantics through gossiping
WWW '03 Proceedings of the 12th international conference on World Wide Web
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compact Labeling Scheme for Ancestor Queries
SIAM Journal on Computing
Informative labeling schemes for graphs
Theoretical Computer Science - Mathematical foundations of computer science 2000
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Hexastore: sextuple indexing for semantic web data management
Proceedings of the VLDB Endowment
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
DLDB2: A Scalable Multi-perspective Semantic Web Repository
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Marvin: Distributed reasoning over large-scale Semantic Web data
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
DRAGO: distributed reasoning architecture for the semantic web
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Semantic overlay networks for p2p systems
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Towards big linked data: a large-scale, distributed semantic data storage
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
srCE: a collaborative editing of scalable semantic stores on P2P networks
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
This work presents MIDAS-RDF, a distributed P2P RDF/S repository that is built on top of a distributed multi-dimensional index structure. MIDAS-RDF features fast retrieval of RDF triples satisfying various pattern queries by translating them into multi-dimensional range queries, which can be processed by the underlying index in hops logarithmic to the number of peers. More importantly, MIDAS-RDF utilizes a labeling scheme to handle expensive transitive closure computations efficiently. This allows for distributed RDFS reasoning in a more scalable way compared to existing methods, as also demonstrated by our extensive experimental study. Furthermore, MIDAS-RDF supports a publish-subscribe model that enables remote peers to selectively subscribe to RDF content.