Get A Taste Of InfiniteGraph: HelloWorld For Graph Databases
I agree with Mr. Popescu. The best way to validate that you’ve got the basics right about a system is to use some basic code. With this idea in mind, I ported his tagging app to InfiniteGraph, a new graph database. Some things I learned in this effort about InfiniteGraph:
- non-primitive vertex attribute types are supported (check out the timestamp in the Resource vertex)
- efficient path evaluation with qualifiers and navigation result handlers
- named vertex indexing is simple but powerful
I am looking forward to trying InfiniteGraph in a distributed deployment for my next post.
The tagging app console output looks like this:
Listing all tags and resources:
Tag: good
Resource: http://xkcd.com/
Resource: http://cnn.com/
Tag: funny
Resource: http://xkcd.com/
Resource: http://theonion.com/
xkcd is tagged with:
Tag: funny
Tag: good
Listing all paths to tagged sites:
Found matching path : goodhttp://xkcd.com/
Found matching path : goodhttp://cnn.com/
Found matching path : goodhttp://xkcd.com/funnyhttp://xkcd.com/
Found matching path : goodhttp://xkcd.com/funnyhttp://theonion.com/
Found matching path : funnyhttp://xkcd.com/
Found matching path : funnyhttp://theonion.com/
Found matching path : funnyhttp://xkcd.com/goodhttp://xkcd.com/
Found matching path : funnyhttp://xkcd.com/goodhttp://cnn.com/
Here’s the code if you are interested.
