Contact Us

Interested? Intrigued? Something to report?

Feel free to get in touch with us.

Concept, Organization, Back-end Bugs

Reach out to Tim Anglade via email or twitter.

Design, Front-end Bugs

Send your queries to Stefano J. Attardi
(Check out his website while you're at it!)

City-specific question

Please talk to your local organizers instead. There's a link to their email address on the About page.

8========D~~~

This one’s for you, Cliff.

Don’t forget to lean into it.

The Graph Traversal Pattern

by Marko A. Rodriguez & Peter Neubauer

To many onlookers, it may seem that the NoSQL-hype is solely focused on scaling data. Many NoSQL databases are designed such that they can horizontally-scale with relatively ease. This is accomplished by making use of data structures that are optimized for sharding. Such data have limited to no direct references between each other. Therefore, the problem of referential integrity does not exist and data can be massively parallelized. Examples of such systems include Amazon’s Dynamo, Google’s Big Table, Apache’s CouchDB, and so on.

In stark contrast to this design choice, on the other side of the NoSQL spectrum, there exists another design choice---the highly interconnected, direct referent data structure of the graph database. Graph databases allow users to solve problems by moving through their data in intelligent/directed ways and with an arbitrary depth. This style of data processing is known as the graph traversal pattern. This pattern is difficult to efficiently achieve with systems that only allow for the joining of data through the use of global indices. The graph traversal pattern is all about local, index-free traversals.

Difficulty rating:

Annotated Versions

None yet.

Upcoming Discussions

None yet.