Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Neo4j Fundamentals Summary

    Uploaded by

    vakivaco

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Neo4j Fundamentals Summary

    Uploaded by

    vakivaco
    14 views1 page

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    14 views1 page

    Neo4j Fundamentals Summary

    Uploaded by

    vakivaco

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    CHEAT SHEET

    Neo4j Fundamentals

    What are graph databases?

    Graphs are mathematical structures consisting of Edges and Vertices In a Property Graph, we refer to these as Nodes and Relationships

    What are graph databases?

    Overview Graphs are useful when: Common Use Cases What gives Neo4j its advantage?
    When the problem requires understanding the relationship between entities. E-commerce platforms combine ratings, purchase history and browsing history Neo4j is a native graph database designed specifically for graph traversal.
    When the problem involves a hierarchy. to provide real-time recommendations. Where Joins between tables are computed at read-time, this information is
    When the problem requires exploring relationships of varying or unknown The ICIJ used Neo4j to explore and understand the network of global saved in a way that allows for quick pointer-chasing in memory
    depth. companies and identify persons with significant control. Queries in Graph Databases are proportional to the amount of data touched
    When the problem requires evaluating routes or paths through a network. Many enterprises use Neo4j for planning, cost analysis, impact analysis and during a query, not the size of data overall.
    also to troubleshoot problems when a problem arises.

    What are Graph Databases?

    Graph Elements Modeling Rules


    Nodes typically represent things. Examples of entities that could typically be represented as a node are:
    A node will commonly represent an individual record, for example, a thing or a
    Node person, product, event, book or subway station.
    fact.
    Relationships are typically verbs. We could use a relationship to represent a personal or professional
    Nodes can have one or more labels. Labels provide a way to group nodes and connection (Person knows Person, Person married to Person), to state a fact (Person lives in Location,
    Label Person owns Car, Person rated Movie), or even to represent a hierarchy (Parent parent of Child, Software
    also serve as a starting point for any database queries.
    depends on Library).
    A relationship connects two nodes. Each relationship has exactly one start and Verbs can also be nodes. A verb may be modeled as a node when one or more facts need to be associated
    Relationship
    end node. A relationship will have a single a type. with it. For example, you may want to group multiple product purchases through a single (:Order) node.

    Type Relationships are identified by their type.

    Both nodes and relationships can contain properties. A property is a key/value


    Property
    pair.

    Non-graph to Graph

    Relational DB to Graph Document Store to Graph Key-Value Store to Graph

    Relational databases store data in tables, rows and columns Data is organized into collections containing documents Key-value stores are great for highly performant lookups on huge amounts of data
    Each row in each table becomes a node, and columns become properties Collection group data, so their names can be used as labels When the values are interconnected, you have a graph
    Most table names can become labels Graphs do not support nested documents, but nested documents can become the structure in the graph Traversing a graph in a key-value store may involve writing complex code
    Forget many-to-many relationships. These are modeled as relationships between two nodes.

    Copyright © 2023 Neo4j GraphAcademy Learn Neo4j for in your own time, free of charge at https://graphacademy.neo4j.com

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy