
'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
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...