UniStore: Querying a DHT-based Universal Storage

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes along with several ambitious challenges a corresponding system has to overcome. In this demonstration paper, we present a lightweight distributed universal storage capable of dealing with those challenges, and providing a powerful and flexible way of building Internet-scale public data management systems. We introduce our approach based on a triple storage on top of a distributed hash table (DHT) overlay system, based on the ideas of a universal relation model and the resource description framework (RDF), and outline solved challenges as well as open issues.


Published in:
Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), 1503-1504
Presented at:
23rd International Conference on Data Engineering (ICDE 2007), Istanbul, Turkey, April 16-20, 2007
Year:
2007
Laboratories:




 Record created 2006-10-11, last modified 2018-01-27

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)