Is there any implementation of Transparent Distributed Queries over a graph database?

• I'm designing a P2P application in which every peer have a partial graph.

• Some nodes in the partial graph can be proxy nodes which contain contact information for another peer.

• That peer's partial graph includes that proxy node (and potentially other parts of the complete graph).

Any chance you can give me some direction on how to implement queries over this graph?

From what I've found in the web there is no real implementation that enable ea开发者_C百科sy querying. infogrid sounds like it might help, but it doesn't seem easy to use or stable. hypergraphDB has a P2P API, but it doesn't seem all that related to the query process.

HypergraphDB does what you want, check out this p2p-intro and this p2p-related Tutorial. It's quite a nice and powerful thing. For instance, it allows you to build a distributed finite state machine. Querying is not part of the P2P API. The latter mainly defines how peers (almost literally) "talk" to each other and communicate about their "interests". Given a HyperGraphPeer p1, you can access that peer's Hypergraph by p1.getGraph on which you can call i.e. find(yourHGQueryCondition). Basically you can broadcast a message to all peers in a peer group, and the messageHandler of the proxy peer can be configured to answer accordingly. HyperGraphDB P2P currently relies on XMPP, but you can easily plugin another by implementing PeerInterface. I'm considering to do so sometime in the next months using redis or akka or hazelcast..

I've made my own decentralized graph database, called GraphPack.