Whether you’re combining data from two different data sources, have multiple purchases from the same customer or just entered the same data in a web form twice, it seems like everyone faces the problem of duplicate data at one point or the other.
There’s a faster algorithm running in linear time that can find the shortest paths from a given source node to all other reachable vertices in a directed acyclic graph, also known as a DAG.
Using this framework, you'll be able to automate the creation of views simply by decorating your existing model classes with custom attributes.
Aaron and Brian speak with Justin Sheehy (CTO at Basho Technologies), about the evolution of applications, new database demands and why NoSQL is changing how we stored and access data.
Zen-Table is an ingenious mechanism consisting of a microcontroller, strong neodynium magnets and a plotter like mechanism to move the "drawing head" across sand on top of a coffee- or desktop-table. Of course the table is programmable.
One of the great appeals of Cassandra is its linear scalability. Need more speed? Just add water, er... nodes to your ring.
In this final post in the series I’m going to leverage some of the technical assets that I’ve created and implement some new user stories using some popular SOA patterns.
Now that I have prepared a skeleton contract-first web-service and created a data access layer using Ektorp and CouchDB, it’s time to wire them together into a fully working entity service. To do this I’m going to use Java EE and Glassfish 3.1.
In case you missed it! We've put together a list of this past week's happenings, goings-ons, new releases, and popular articles. So you're all caught up in the world of NoSQL!
This presentation by Nati Shalom (Founder and CTO of GigaSpaces) walks you through some of the challenges of designing a Twitter-like large-scale NoSQL/DataGrid application.
I am a bioinformatics scientist contracted to a large US government research initiative. Our clients were interested in alternatives to RDBMS to represent the big data we manage.
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.