Errata

Graph Databases

Errata for Graph Databases

Submit your own errata for this product.

The errata list is a list of errors and their corrections that were found after the product was released. If the error was corrected in a later version or reprint the date of the correction will be displayed in the column titled "Date Corrected".

The following errata were submitted by our customers and approved as valid errors by the author or editor.

Color key: Serious technical mistake Minor technical mistake Language or formatting error Typo Question Note Update

Version Location Description Submitted By Date submitted Date corrected
Safari Books Online
Don't know page number; found in Safari in "Querying Graphs: An Introduction to Cypher" section

"Many, including Neo4j, support the RDF query language SPARQL" Neo4j does not support SPARQL. http://www.neo4j.org/develop/linked_data points to the plugin at http://neo4j-contrib.github.io/sparql-plugin/, which is barely a proof of concept, certainly not qualifying as anything approaching real SPARQL support for Neo4j. Unless I'm missing something else...

 Bob DuCharme
Bob DuCharme
 		 Jun 11, 2014 
Other Digital Version
i
General problem

The Kindle version of this book is lacking a table of contents.

 Anonymous  Jul 26, 2014 
Printed
Page 4
In box

... variant of graph model, ... should be: ... variant of graph models, ...

 Anonymous  Apr 01, 2014 
Printed
Page 4
the box

The bullet points in the box should all end with a . (period)

Anonymous  Apr 01, 2014 
Printed
Page 6
in note

... nontraversal ... should be: ... non-traversal ... Also, on the same page: ... on the market today based on ... should be: ... on the market today, based on ...

 Anonymous  Apr 01, 2014 
PDF
Page 8
Line 4

The previous section provided a course-grained overview of the entire graph space. course-grained >> coarse-grained

 Anonymous  Oct 25, 2013 
Printed
Page 8
Text box near top of page

"Course-grained overview" should be changed to "coarse-grained overview."

 Jeff Tyzzer  Nov 29, 2013 
Printed
Page 14
various

Though it�s possible get an ... should be: Though it�s possible to get an ... ... sword of schema. should be: ... sword of schemas. More often than not, schema proves to ... should be: More often than not, schemas prove to ...

 Anonymous  Apr 01, 2014 
PDF
Page 19
Figure 2-5

The BOSS_OF relationship is bidirectional, James is the boss of Zach and Zach is the boss of James. Surely this should be unidirectional? While the text suggests unrequited love, it does not contain any examples. The diagram states Zach is in love with both Harriet and Ingrid however the implication is that he is in love with just one.

 Anonymous  Oct 05, 2013 
PDF
Page 19
Figure 2-5, last paragraph

The text describing figure 2-5 makes it seems the figure should have asymmetric relationships. For example, James and Zach cannot be bosses of each other (via the BOSS_OF relationship), but the relationship is symmetric. Also the mention of "love being requited" in the text does not apply since both "LOVES" relationship are symmetric. The text would make more sense if figure 2-5 was updated to reflect what the text is describing.

 Byron Ruth  Nov 27, 2013 
Printed
Page 19
bottom of page

We can see who is a COLLEAGUE_OF of whom, ... should be: We can see who is a COLLEAGUE_OF whom, ...

Anonymous  Apr 01, 2014 
Printed, PDF
Page 20
3rd paragraph

The experiment of Partner and Vukotic is describes as "Given any two persons chosen at random, is there a path that connects them that is at most five relationships long" The book "Neo4j in Action" actually is "...about finding _all_ friends of _a_ user's friend" (emphasis added - Section 1.2.1, page 4, paragraph 3). Its about counting the numbers of friends of one known person, not about finding a path between two known people. The table 2.1 in 'Graph Databases' on the same page also shows the number of friends for one given person, at a specified depth.

Note from the Author or Editor:
Description of the Partner and Vukotic experiment needs revising.

 Joerg Baach  Jul 31, 2013 
PDF
Page 28
Figure 3-1. A simple graph pattern, expressed using a diagram

The arrows from the diagram are in the opposite direction, so there is a mismatch between the diagram and the related Cypher query: (a)-[:KNOWS]->(b)-[:KNOWS]->(c), (a)-[:KNOWS]->(c)

Note from the Author or Editor:
KNOWS arrows should go from A to B, A to C, and B to C

 Anonymous  Jun 02, 2013 
PDF
Page 29
End of Cypher code block

The trailing ';' is missing from the code block. The same is true for most (but not all) subsequent blocks. Also, this being an introduction to Cypher, it should be mentioned somewhere that statements must be terminated with a semicolon.

Bjørn-Helge Mevik  Jul 21, 2013 
Printed, PDF, ePub, Mobi, Safari Books Online, Other Digital Version
Page 35
Figure 3-4

The Database slave/master relationship from the ER diagram (Figure 3-3) is missing in Figure 3-4.

Note from the Author or Editor:
Diagram has been updated in Atlas repository.

 Bjørn-Helge Mevik  Jul 21, 2013 
Printed, PDF, ePub, Mobi, Safari Books Online, Other Digital Version
Page 39
First paragraph

The first (complete) sentence on the page reads: 'For our data center example, we can read off sen‐ tences like �Load balancer 1 fronts the App, which consists of App Instance 1, 2, and 3, and the Database, which resides on Database Machine 1 and Database Machine 2,� and �Blade 3 runs VM 3, which hosts App Instance 3.�' These sentences do not match what the graph (and previous text) shows. For instance, there is on "App Instance" entites, only "App". And there are no "Blade" entities, and no node "VM 3".

Note from the Author or Editor:
Already pushed to Atlas.

 Bjørn-Helge Mevik  Jul 21, 2013 
Printed, PDF
Page 44
first code example

The examples don't work without further work. The book wants to use cypher only, and uses examples written for 2.0 (see footnote 1 on page 27). With these requirements, its not possible to run the examples, which frustrated me quite a bit on first reading the book. I prepared modified examples (and more explaination): https://baach.de/Members/jhb/working-examples-for-the-graph-databases-book Thanks for the fantastic book!

Note from the Author or Editor:
Instructions for running the examples can be found here: http://iansrobinson.com/2013/06/11/running-the-graph-databases-bookexamples/

 Joerg Baach  Jul 11, 2013 
PDF
Page 46
1st paragraph

Node index names in the Cypher code and the 1st paragraph are inconsistent. Should be either 'venue' or 'venues' - line 1 and 5 (and) 'author' or 'authors' - line 3 and 9.

Note from the Author or Editor:
Paragraph should read: "This START clause identifies all nodes with a property key name and property value Theatre Royal in a node index called venue. The results of this index lookup are bound to the identifier theater. (What if there are many Theatre Royal nodes in this index? Well deal with that shortly.) In a second index lookup, we find the node representing the city of Newcastle; we bind this node to the identifier newcastle. Finally, as with our earlier Shakespeare query, to find the Shakespeare node itself, we look in the author index for a node with a lastname property whose value is Shakespeare. We bind the result of this lookup to bard."

 Anonymous  Jul 09, 2013 
PDF
Page 46
Portugal

In the diagram, it would be preferable to indicate that both slave database are dependent from the master and not chain the dependency... The same happens p. 52

 Micha�l Memeteau  Oct 12, 2013 
PDF
Page 47
Cypher code block

The query doesn't work, because it depends on indexes that has not been created. The same seems to be true with all subsequent examples. Even worse, I cannot find any place in the book how to create indexes.

Note from the Author or Editor:
For readers wanting to code along with the examples, there is something missing from the book around indexes. As an interim solution, readers can consult: http://iansrobinson.com/2013/06/11/running-the-graph-databases-bookexamples/

 Bjørn-Helge Mevik  Jul 21, 2013 
PDF
Page 52
Figure 3-8

The ALIAS_OF arrow should point from Alice to Bob, not from Bob to Alice.

 Bjørn-Helge Mevik  Jul 21, 2013 
PDF
Page 56
4rd paragraph

"in the form of a node with the key company and value RSC. " should be "in the form of a node with the key name and value RSC. "

Note from the Author or Editor:
text should read "in the form of a node with the key name and value RSC."

 Anonymous  Jul 03, 2013 
PDF
Page 56
2nd paragraph of Evolving the Domain chapter

Is the phrase: ... is still fit for purpose after the the structural ... The word the is duplicated.

Note from the Author or Editor:
should read "is still fit for purpose after the structural"

 Luciano Santos Borges  Sep 06, 2013 
Printed, PDF
Page 64
bottom cypher query

Nodes in MATCH should be in parenthesis.

 Jerome  Jan 29, 2014 
Printed, PDF
Page 94
performance title, 3rd paragraph

Section "Calculating the cost of graph database performance", 3rd paragraph: Sentence "Spinning disks and SDDs are cheap" should be "Spinning disks and SSDs are cheap" SSD typo error

Emanuele Zamprogno  Feb 09, 2014 
Printed, PDF
Page 134
last sentence, and firstsentence of 135

Replace "ValidPathExpander" with "IntervalPathExpander" in last sentence of p. 134 and first sentence of p. 135.

 Jerome  Jan 29, 2014 
Other Digital Version
177
1st paragraph

"..., if Alice MAN AGES Bob ..." Should be: "..., if Alice MAN- AGES Bob ..."

 Anonymous  Jul 24, 2014 
Printed, PDF
Page 195
second to last paragraph

Last sentence of paragraph begins with "Aggregate stores may be good at strong data that's big". Replace "strong" with "storing".

 Jerome  Jan 30, 2014 
Other Digital Version
3947

Chapter 7, first sentence. "we're going consider..." should be "we're going to consider..."

 Victor C  Mar 25, 2014