Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Graph Databases

    Graph Databases

    Ian Robinson, Jim Webber, Emil Eifrem · 2013

    Systems & OS
    Open LibraryAmazon
    Stats for nerds
    1recommend
    3mentions
    3people
    2013–2014years
    33% recommend67% neutral

    Mentions per year

    20132014

    What Hacker News says

    1. argimenesDec 2013
      'Graph Databases' by Ian Robinson, Jim Webber, and Emil Eifrem

      'Hackers and Painters' by Paul Graham

      'Virtual Reality' by Howard Rheingold

      'Stack Computers: The New Wave' by Philip Koopman

      'Thinking Forth' by Leo Brodie

      'WIMP Programming for All on Acorn RISC Computers' by Lee Calcraft and Alan Wrigley

      'Frank Herbert' by Timothy O'Reilly

      'Modern Painters: volume 1' by John Ruskin

      'Aratra Pentelici' by John Ruskin

      'The Art and Craft of Drawing' by Vernon Blake

      'The Romance of Leonardo da Vinci' by Dmitri Merezhkovsky ('romance' in the old sense of 'biographical novel')

      'Prehistoric Avebury' by Aubrey Burl

      'A Canticle for Leibowitz' by Walter M. Miller

      thread
    2. ancatruscaMay 2014
      InfoQ spoke with Jim Webber and Ian Robinson in Neo Technologies team (also co-authors of Graph Databases book) about the data modeling efforts and best practices when using Graph databases for data management and analytics.
      thread
    3. h1karuApr 2014
      The approach I like is to use a key/value document store as the system of record (SOR). If any data conflicts arise between Redis, the document store, and the graph database, then the SOR wins. A good SOR should contain all of the data necessary to rebuild any other data source in its domain.

      Graph databases can scale write throughput fine when those writes are being fed to it from a single source so it's best to have a service who's sole purpose is to keep the graph database in sync with the SOR. The graph should only store the data you actually need in order to get the queries that you want.

      The specific queries in my domain are exactly the kind of thing I'm not supposed to talk about, but I will say you can do things like:

      Give me 50 users who who live near me (lat/long bounding box), who I'm not already following, who I have not already sent a message to, who have at least two friends who also live near me, and who have matching tags, order by number of followers.

      there are a bunch of great examples in this awesome book: http://www.amazon.com/Graph-Databases-Ian-Robinson/dp/144935...

      thread

    Related

    Cover of Database systems
    2010–2026

    Database systems

    Hector Garcia-Molina
    11 recommend · 19
    Cover of The Stanford GraphBase
    2009–2025

    The Stanford GraphBase

    Donald Knuth
    5 recommend · 28
    Cover of Foundations of databases
    2008–2025

    Foundations of databases

    Serge Abiteboul
    1 recommend · 6
    Cover of The elements of graphing data
    2010–2023

    The elements of graphing data

    William S. Cleveland
    6 recommend · 8
    Cover of An introduction to database systems
    2009–2024

    An introduction to database systems

    C. J. Date
    14 recommend · 35
    Cover of Mathematics for Computer Science
    2009–2025

    Mathematics for Computer Science

    Eric Lehman
    37 recommend · 70
    Cover of Computer Networks
    2007–2026

    Computer Networks

    Andrew S. Tanenbaum
    50 recommend · 110
    Cover of Translucent Databases
    2008–2024

    Translucent Databases

    Peter Wayner
    8 recommend · 31