Raju Rama Krishna
Wellington, NZ
17th May
Topics:- High Scalability, MongoDB, Redis
WJUG 2013-04-17: Raju Ramakrishna - NoSQL Family from John Hurst on Vimeo.
Wellington, NZ
17th May
Topics:- High Scalability, MongoDB, Redis
WJUG 2013-04-17: Raju Ramakrishna - NoSQL Family from John Hurst on Vimeo.
Please implement a graph database (a kind of NoSQL). This graph database
ReplyDeleteshould consist of nodes (with have properties) for entities and edges (which
have single or multiple properties and can be directional or bidirectional) for
relationships, and support node indexing and query. The query language has
following keywords: START, MATCH, WHERE, RETURN, ORDER BY,
AGGREGATE, SKIP, and LIMIT.
Example Input:
Node martin = graphDB.createNode();
martin.setProperty(“name”, “Martin”);
Node pramod = graphDB.createNode();
pramod.setProperty(“name”, “Pramod”);
Node barbara = graphDB.createNode();
pramod.setProperty(“name”, “Barbara”);
martin.createRelationshipTo(pramod, FRIEND, since = 1998);
pramod.createRelationshipTo(martin, FRIEND, since = 1998);
martin.createRelationshipTo(barbara, FRIEND);
barbara.createRelationshipTo(martin, FRIEND);
START node = Node:nodeIndex(name = “Barbara”)
MATCH path = node-[relation*1..3]->related_node
WHERE type(relation) = ‘FRIEND’
RETURN related_node.name, length(path), relation.since;
Could you please explain the implementation with example
DeleteHi Kalyan.. Sorry just saw your comment. You figured it out or you want me to explain?
ReplyDelete