Table of Contents
- 6.1. ACL structures in graphs
- 6.2. Hyperedges
- 6.3. Basic friend finding based on social neighborhood
- 6.4. Co-favorited places
- 6.5. Find people based on similar favorites
- 6.6. Find people based on mutual friends and groups
- 6.7. Find friends based on similar tagging
- 6.8. Multirelational (social) graphs
- 6.9. Implementing newsfeeds in a graph
- 6.10. Boosting recommendation results
- 6.11. Calculating the clustering coefficient of a network
- 6.12. Pretty graphs
- 6.13. A multilevel indexing structure (path tree)
- 6.14. Complex similarity computations
- 6.15. The Graphity activity stream model
- 6.16. User roles in graphs
The following chapters contain simplified examples of how different domains can be modeled using Neo4j. The aim is not to give full examples, but to suggest possible ways to think using nodes, relationships, graph patterns and data locality in traversals.
The examples use Cypher queries a lot, read Cypher Query Language for more information.