Classing a whole swathe of products as "NoSQL" is misleading and confusing. The only thing they all share in common is that they are not traditional relational databases.
Following on from part two of this series where I created and deployed the Product Entity Service using the SOA ‘contract-first’ technique, I’m now going to work on the NoSQL database aspects of the service implementation.
With the release of a new version of the open source graph database, Neo4j, and the fast-approaching Graph Connect conference (the first EVER graph database-focused conference, btw), we thought it'd be a good idea to talk to a couple of leaders in the graph database space.
As we saw in the previous post, Dijkstra's algorithm is very useful when it comes to finding all the shortest paths in a weighted graph. However, it has one major problem! Obviously it doesn’t work correctly when dealing with negative lengths of the edges.
Meet us during this week's (Oct 15-18) SpringOne 2GX 2012 conference in Washington D.C. where we're proudly participating as a Gold Sponsor.
I want to show you how you can use a graph database like Neo4j to help your users find what they want... differently.
In this article I will describe how I got it set up and working on my Mac running OS X 10.8.2 and MAMP with PHP 5.2.17 and PHP 5.3.6.
In the current release instead of supporting one new engine, I focused on implementing an embedded in-memory Redis engine based on Jedis.
In case you missed it, we review the past week of goings-on in the realm of NoSQL, including new releases, new books, top NoSQL links, and upcoming events.
It’s time to begin the coding of my SOA entity service with NoSQL project, and as promised I’m starting with the web service’s contract.
I want to build the entity service by using as little Java code as possible but at the same time preserve the contract-first approach.
Chris Harris and Alvin Richards present "MongoDB in Production." Chris Harris is European Solution Architect at 10gen and Alvin Richards is the Senior Director, Enterprise Engineering at 10gen.
We must only answer the question is BFS the best algorithm that finds the shortest path between any two nodes of the graph?
My Sunday reading session was on a couple of great NoSQL blog posts that are definitely worth reading.
Using Spring Data Neo4j it was incredibly easy to model and import the Hubway Challenge dataset into a Neo4j graph database, to make it available for advanced querying and visualization.
I am happy to announce the latest version of Dex, MongoLab’s Index Bot. With version 0.5, we’re declaring Dex halfway-there in terms of major features.
In this article, I will help you quickly write Geospatial queries described in the following presentation using Java. I assume you have MongoDB server up and running on your machine.
Continuing to discover the powerful set of Redis features, the one worth mentioning about is out of the box support of pub/sub messaging.
I created a sample project and put it out on github. Let me know if you have any trouble.
In this first edition of a new weekly post, we will revisit the past week to make sure you are completely up-to-date in the world of NoSQL.
How do you create the best index for a complex MongoDB query? I'll present a method specifically for queries that combine equality tests, sorts, and range filters, and demonstrate the best order for fields in a compound index.
Last month I presented a webinar introducing the basics of application development using VoltDB. We had a lot of great questions and I thought it would be handy to write them up and share the answers with everyone.
Since with graphs we can represent real-life problems it’s almost clear why we would need an efficient algorithm that calculates the shortest path between two vertices.
Probably the closest database object-relationally to Postgres is Informix. Informix in fact got its object-relational approach with the purchase of Illustra, a Postgres fork.
I was working on a section on the gooey innards of journaling for The Definitive Guide, but then I realized it’s an implementation detail that most people won’t care about. However, I had all of these nice diagrams just laying around.