Graph Database Fundamentals

<h2 id="graph-database-fundamentals" class="position-relative d-flex align-items-center group"> Graph Database Fundamentals <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="graph-database-fundamentals" aria-haspopup="dialog" aria-label="Share link: Graph Database Fundamentals"> Share link </button> </h2><div id="headingShareModal" class="heading-share-modal" role="dialog" aria-modal="true" aria-labelledby="headingShareTitle" hidden> <div class="hsm-dialog" role="document"> <div class="hsm-header"> <h2 id="headingShareTitle" class="h6 mb-0 fw-bold">Share this section</h2> <button type="button" class="hsm-close" aria-label="Close"> </button> </div> <div class="hsm-body"> <label for="headingShareInput" class="form-label small text-muted mb-1 text-uppercase fw-bold" style="font-size: 0.7rem; letter-spacing: 0.5px;">Permalink</label> <div class="input-group mb-4 hsm-url-group"> <input id="headingShareInput" type="text" class="form-control font-monospace" readonly aria-readonly="true" style="font-size: 0.85rem;" /> <button class="btn btn-primary hsm-copy" type="button" aria-label="Copy" title="Copy"> </button> </div> <div class="small fw-bold mb-2 text-muted text-uppercase" style="font-size: 0.7rem; letter-spacing: 0.5px;">Share via</div> <div class="hsm-share-grid"> <a id="share-twitter" class="btn btn-outline-secondary w-100" target="_blank" rel="noopener noreferrer"> Twitter </a> <a id="share-linkedin" class="btn btn-outline-secondary w-100" target="_blank" rel="noopener noreferrer"> LinkedIn </a> <a id="share-facebook" class="btn btn-outline-secondary w-100" target="_blank" rel="noopener noreferrer"> Facebook </a> </div> </div> </div> </div> <style> .heading-share-modal { position: fixed; inset: 0; display: flex; justify-content: center; align-items: center; background: rgba(0, 0, 0, 0.6); z-index: 1050; padding: 1rem; backdrop-filter: blur(4px); -webkit-backdrop-filter: blur(4px); } .heading-share-modal[hidden] { display: none !important; } .hsm-dialog { max-width: 420px; width: 100%; background: var(--bs-body-bg, #fff); color: var(--bs-body-color, #212529); border: 1px solid var(--bs-border-color, rgba(0,0,0,0.1)); border-radius: 1rem; box-shadow: 0 25px 50px -12px rgba(0, 0, 0, 0.25); overflow: hidden; animation: hsm-fade-in 0.2s ease-out; } @keyframes hsm-fade-in { from { opacity: 0; transform: scale(0.95); } to { opacity: 1; transform: scale(1); } } [data-bs-theme="dark"] .hsm-dialog { background: #1e293b; border-color: rgba(255,255,255,0.1); color: #f8f9fa; } .hsm-header { display: flex; justify-content: space-between; align-items: center; padding: 1rem 1.5rem; border-bottom: 1px solid var(--bs-border-color, rgba(0,0,0,0.1)); background: rgba(0,0,0,0.02); } [data-bs-theme="dark"] .hsm-header { background: rgba(255,255,255,0.02); border-color: rgba(255,255,255,0.1); } .hsm-close { background: transparent; border: none; color: inherit; opacity: 0.5; padding: 0.25rem 0.5rem; border-radius: 0.25rem; font-size: 1.2rem; line-height: 1; transition: opacity 0.2s; } .hsm-close:hover { opacity: 1; } .hsm-body { padding: 1.5rem; } .hsm-url-group { display: flex !important; align-items: stretch; } .hsm-url-group .form-control { flex: 1; min-width: 0; margin: 0; background: var(--bs-secondary-bg, #f8f9fa); border-color: var(--bs-border-color, #dee2e6); border-top-right-radius: 0; border-bottom-right-radius: 0; height: 42px; } .hsm-url-group .btn { flex: 0 0 auto; margin: 0; margin-left: -1px; border-top-left-radius: 0; border-bottom-left-radius: 0; height: 42px; display: flex; align-items: center; justify-content: center; padding: 0 1.25rem; z-index: 2; } [data-bs-theme="dark"] .hsm-url-group .form-control { background: #0f172a; border-color: #334155; color: #e2e8f0; } .hsm-share-grid { display: flex; flex-direction: column; gap: 0.5rem; } .hsm-share-grid .btn { display: flex; align-items: center; justify-content: center; font-size: 0.9rem; padding: 0.6rem; border-color: var(--bs-border-color); width: 100%; } [data-bs-theme="dark"] .hsm-share-grid .btn { color: #e2e8f0; border-color: #475569; } [data-bs-theme="dark"] .hsm-share-grid .btn:hover { background: #334155; border-color: #cbd5e1; } </style> <script> (function(){ const modal = document.getElementById('headingShareModal'); if(!modal) return; const input = modal.querySelector('#headingShareInput'); const copyBtn = modal.querySelector('.hsm-copy'); const twitter = modal.querySelector('#share-twitter'); const linkedin = modal.querySelector('#share-linkedin'); const facebook = modal.querySelector('#share-facebook'); const closeBtn = modal.querySelector('.hsm-close'); let lastFocus=null; let trapBound=false; function buildUrl(id){ return window.location.origin + window.location.pathname + '#' + id; } function isOpen(){ return !modal.hasAttribute('hidden'); } function hydrate(id){ const url=buildUrl(id); input.value=url; const enc=encodeURIComponent(url); const text=encodeURIComponent(document.title); if(twitter) twitter.href=`https://twitter.com/intent/tweet?url=${enc}&text=${text}`; if(linkedin) linkedin.href=`https://www.linkedin.com/sharing/share-offsite/?url=${enc}`; if(facebook) facebook.href=`https://www.facebook.com/sharer/sharer.php?u=${enc}`; } function openModal(id){ lastFocus=document.activeElement; hydrate(id); if(!isOpen()){ modal.removeAttribute('hidden'); } requestAnimationFrame(()=>{ input.focus(); }); trapFocus(); } function closeModal(){ if(!isOpen()) return; modal.setAttribute('hidden',''); if(lastFocus && typeof lastFocus.focus==='function') lastFocus.focus(); } function copyCurrent(){ try{ navigator.clipboard.writeText(input.value).then(()=>feedback(true),()=>fallback()); } catch(e){ fallback(); } } function fallback(){ input.select(); try{ document.execCommand('copy'); feedback(true);}catch(e){ feedback(false);} } function feedback(ok){ if(!copyBtn) return; const icon=copyBtn.querySelector('i'); if(!icon) return; const prev=copyBtn.getAttribute('data-prev')||icon.className; if(!copyBtn.getAttribute('data-prev')) copyBtn.setAttribute('data-prev',prev); icon.className= ok ? 'fa-duotone fa-clipboard-check':'fa-duotone fa-circle-exclamation'; setTimeout(()=>{ icon.className=prev; },1800); } function handleShareClick(e){ e.preventDefault(); const btn=e.currentTarget; const id=btn.getAttribute('data-share-target'); if(id) openModal(id); } function bindShareButtons(){ document.querySelectorAll('.h-share').forEach(btn=>{ if(!btn.dataset.hShareBound){ btn.addEventListener('click', handleShareClick); btn.dataset.hShareBound='1'; } }); } bindShareButtons(); if(document.readyState==='loading'){ document.addEventListener('DOMContentLoaded', bindShareButtons); } else { requestAnimationFrame(bindShareButtons); } document.addEventListener('click', function(e){ const shareBtn=e.target.closest && e.target.closest('.h-share'); if(shareBtn && !shareBtn.dataset.hShareBound){ handleShareClick.call(shareBtn, e); } }, true); document.addEventListener('click', e=>{ if(e.target===modal) closeModal(); if(e.target.closest && e.target.closest('.hsm-close')){ e.preventDefault(); closeModal(); } if(copyBtn && (e.target===copyBtn || (e.target.closest && e.target.closest('.hsm-copy')))) { e.preventDefault(); copyCurrent(); } }); document.addEventListener('keydown', e=>{ if(e.key==='Escape' && isOpen()) closeModal(); }); function trapFocus(){ if(trapBound) return; trapBound=true; modal.addEventListener('keydown', f=>{ if(f.key==='Tab' && isOpen()){ const focusable=[...modal.querySelectorAll('a[href],button,input,textarea,select,[tabindex]:not([tabindex="-1"])')].filter(el=>!el.hasAttribute('disabled')); if(!focusable.length) return; const first=focusable[0]; const last=focusable[focusable.length-1]; if(f.shiftKey && document.activeElement===first){ f.preventDefault(); last.focus(); } else if(!f.shiftKey && document.activeElement===last){ f.preventDefault(); first.focus(); } } }); } if(closeBtn) closeBtn.addEventListener('click', e=>{ e.preventDefault(); closeModal(); }); })(); </script>Graph databases represent a fundamental shift in how we model and query connected data. Unlike traditional relational databases that use tables and joins, graph databases store data as nodes (entities) and relationships (connections), making them naturally suited for highly connected datasets where relationships are as important as the data itself. <h3 id="what-is-a-graph-database" class="position-relative d-flex align-items-center group"> What is a Graph Database? <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="what-is-a-graph-database" aria-haspopup="dialog" aria-label="Share link: What is a Graph Database?"> Share link </button> </h3>A graph database is a database management system that uses graph structures with nodes, relationships, and properties to represent and store data. The graph relates the data items in the store to a collection of nodes and edges, where edges represent the relationships between nodes. <h4 id="core-components" class="position-relative d-flex align-items-center group"> Core Components <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="core-components" aria-haspopup="dialog" aria-label="Share link: Core Components"> Share link </button> </h4><ol> <li>Nodes: Represent entities (people, products, locations, etc.)</li> <li>Relationships: Connect nodes and represent how entities relate</li> <li>Properties: Key-value pairs attached to nodes and relationships</li> <li>Labels: Categorize nodes into groups (optional, implementation-specific)</li> </ol> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Node example: Person with properties (p:Person { id: 'user123', name: 'Alice Johnson', email: 'alice@example.com', age: 32 }) -- Relationship example: connecting two nodes (alice:Person)-[r:KNOWS {since: DATE '2020-05-15', context: 'college'}]->(bob:Person) </code></pre></div> <h3 id="graph-theory-background" class="position-relative d-flex align-items-center group"> Graph Theory Background <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="graph-theory-background" aria-haspopup="dialog" aria-label="Share link: Graph Theory Background"> Share link </button> </h3>Graph databases are based on mathematical graph theory, which has been studied for centuries. <h4 id="mathematical-definition" class="position-relative d-flex align-items-center group"> Mathematical Definition <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="mathematical-definition" aria-haspopup="dialog" aria-label="Share link: Mathematical Definition"> Share link </button> </h4>A graph G is defined as G = (V, E) where: <ul> <li>V is a set of vertices (nodes)</li> <li>E is a set of edges (relationships)</li> </ul> In property graphs (like Geode), we extend this to: <ul> <li>Each vertex has properties: v = {label, {k₁: v₁, k₂: v₂, …}}</li> <li>Each edge has type and properties: e = {type, {k₁: v₁, k₂: v₂, …}}</li> </ul> <h4 id="graph-types" class="position-relative d-flex align-items-center group"> Graph Types <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="graph-types" aria-haspopup="dialog" aria-label="Share link: Graph Types"> Share link </button> </h4>Directed vs. Undirected <ul> <li>Directed: Relationships have direction (A→B is different from B→A)</li> <li>Undirected: Relationships are bidirectional</li> </ul> Most graph databases, including Geode, use directed graphs where relationships have explicit direction. <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Directed relationship (alice:Person)-[:FOLLOWS]->(bob:Person) -- Alice follows Bob, but Bob doesn't necessarily follow Alice -- To query bidirectionally MATCH (a:Person)-[:FOLLOWS]-(b:Person) WHERE a.name = 'Alice' -- Finds relationships in both directions </code></pre></div>Weighted vs. Unweighted <ul> <li>Weighted: Relationships have numeric weights (distances, costs, strengths)</li> <li>Unweighted: All relationships are equal</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Weighted graph: social network with interaction strength (user1)-[:INTERACTS {weight: 0.85, interactions: 47}]->(user2) </code></pre></div>Cyclic vs. Acyclic <ul> <li>Cyclic: Contains cycles (paths that loop back)</li> <li>Acyclic: No cycles (directed acyclic graphs - DAGs)</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- DAG example: task dependencies (no circular dependencies allowed) (task1:Task)-[:DEPENDS_ON]->(task2:Task)-[:DEPENDS_ON]->(task3:Task) -- Cyclic example: social network (mutual follows create cycles) (alice)-[:FOLLOWS]->(bob)-[:FOLLOWS]->(charlie)-[:FOLLOWS]->(alice) </code></pre></div> <h3 id="property-graph-model" class="position-relative d-flex align-items-center group"> Property Graph Model <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="property-graph-model" aria-haspopup="dialog" aria-label="Share link: Property Graph Model"> Share link </button> </h3>Geode implements the property graph model, the most popular graph database model (used by Neo4j, Neptune, TigerGraph, and others). <h4 id="key-characteristics" class="position-relative d-flex align-items-center group"> Key Characteristics <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="key-characteristics" aria-haspopup="dialog" aria-label="Share link: Key Characteristics"> Share link </button> </h4><ol> <li>Nodes and Relationships are First-Class Citizens: Both can have properties</li> <li>Multi-Relational: Multiple relationship types between same nodes</li> <li>Schema-Optional: Can be schema-free, schema-enforced, or hybrid</li> <li>Type System: Rich data types (strings, numbers, dates, lists, maps)</li> </ol> <h4 id="example-social-network" class="position-relative d-flex align-items-center group"> Example: Social Network <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="example-social-network" aria-haspopup="dialog" aria-label="Share link: Example: Social Network"> Share link </button> </h4><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Create users INSERT (alice:Person {name: 'Alice', city: 'San Francisco', joined: DATE '2024-01-15'}); INSERT (bob:Person {name: 'Bob', city: 'New York', joined: DATE '2024-02-20'}); INSERT (charlie:Person {name: 'Charlie', city: 'Austin', joined: DATE '2024-03-10'}); -- Create relationships INSERT (alice)-[:FOLLOWS {since: CURRENT_DATE}]->(bob); INSERT (bob)-[:FOLLOWS {since: CURRENT_DATE}]->(charlie); INSERT (charlie)-[:FOLLOWS {since: CURRENT_DATE}]->(alice); -- Create content INSERT (post:Post {title: 'Graph Databases 101', created: CURRENT_TIMESTAMP}); INSERT (alice)-[:AUTHORED]->(post); INSERT (bob)-[:LIKED {timestamp: CURRENT_TIMESTAMP}]->(post); -- Query the graph MATCH (author:Person)-[:AUTHORED]->(post:Post)<-[:LIKED]-(liker:Person) RETURN author.name, post.title, collect(liker.name) AS likers; </code></pre></div> <h3 id="when-to-use-graph-databases" class="position-relative d-flex align-items-center group"> When to Use Graph Databases <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="when-to-use-graph-databases" aria-haspopup="dialog" aria-label="Share link: When to Use Graph Databases"> Share link </button> </h3> <h4 id="ideal-use-cases" class="position-relative d-flex align-items-center group"> Ideal Use Cases <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="ideal-use-cases" aria-haspopup="dialog" aria-label="Share link: Ideal Use Cases"> Share link </button> </h4>1. Social Networks <ul> <li>Friend connections, followers, recommendations</li> <li>Natural graph structure with nodes (users) and relationships (connections)</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Find friends of friends who like similar content MATCH (me:User {id: $user_id})-[:FRIEND]->(friend)-[:FRIEND]->(fof:User) WHERE NOT EXISTS { MATCH (me)-[:FRIEND]->(fof) } AND fof <> me MATCH (me)-[:LIKES]->(interest:Interest)<-[:LIKES]-(fof) RETURN fof.name, count(interest) AS common_interests ORDER BY common_interests DESC LIMIT 10; </code></pre></div>2. Recommendation Engines <ul> <li>Collaborative filtering, content recommendations, personalization</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Recommend products based on similar users MATCH (u1:User {id: $user_id})-[:PURCHASED]->(p:Product)<-[:PURCHASED]-(u2:User) MATCH (u2)-[:PURCHASED]->(rec:Product) WHERE NOT EXISTS { MATCH (u1)-[:PURCHASED]->(rec) } RETURN rec.name, count(u2) AS recommendation_strength ORDER BY recommendation_strength DESC LIMIT 20; </code></pre></div>3. Fraud Detection <ul> <li>Pattern matching for suspicious behavior, money laundering detection</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Detect circular transaction patterns (potential money laundering) MATCH path = (a:Account)-[:TRANSFER*3..5]->(a) WHERE all(r IN relationships(path) WHERE r.amount > 10000) AND all(r IN relationships(path) WHERE r.timestamp >= CURRENT_DATE - DURATION 'P7D') RETURN path, reduce(total = 0, r IN relationships(path) | total + r.amount) AS total_amount ORDER BY total_amount DESC; </code></pre></div>4. Knowledge Graphs <ul> <li>Semantic networks, ontologies, Wikipedia-style interconnected knowledge</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Explore knowledge graph connections MATCH (entity:Entity {name: 'Albert Einstein'}) -[r1:RELATED_TO]->(related) -[r2:RELATED_TO]->(further) RETURN entity.name, type(r1), related.name, type(r2), further.name LIMIT 100; </code></pre></div>5. Network and Infrastructure Management <ul> <li>IT systems, telecommunications, power grids, logistics networks</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Find impact of server failure MATCH (failed:Server {id: 'srv-42'})<-[:DEPENDS_ON*]-(affected:Service) RETURN affected.name, affected.criticality, affected.users_affected ORDER BY affected.criticality DESC; </code></pre></div>6. Access Control and Authorization <ul> <li>Role hierarchies, permission inheritance, complex authorization rules</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Check if user has permission (direct or inherited) MATCH path = (u:User {id: $user_id})-[:HAS_ROLE*]->(r:Role)-[:HAS_PERMISSION]->(p:Permission) WHERE p.action = $action AND p.resource = $resource RETURN count(path) > 0 AS has_permission; </code></pre></div> <h4 id="when-not-to-use-graph-databases" class="position-relative d-flex align-items-center group"> When NOT to Use Graph Databases <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="when-not-to-use-graph-databases" aria-haspopup="dialog" aria-label="Share link: When NOT to Use Graph Databases"> Share link </button> </h4>1. Simple Tabular Data If your data has few relationships and mostly consists of independent records, relational databases are simpler and more efficient. 2. High-Volume Transactional Systems For pure OLTP with simple queries (e.g., account balance lookups), traditional RDBMS may be faster. 3. Large Binary Objects Graph databases are not optimized for storing large files, videos, or images. Use object storage (S3) and store references in the graph. 4. Pure Aggregations Without Relationships For time-series data or analytics without relationship traversal, specialized databases (InfluxDB, ClickHouse) may be better. <h3 id="graph-database-architecture" class="position-relative d-flex align-items-center group"> Graph Database Architecture <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="graph-database-architecture" aria-haspopup="dialog" aria-label="Share link: Graph Database Architecture"> Share link </button> </h3> <h4 id="storage-strategies" class="position-relative d-flex align-items-center group"> Storage Strategies <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="storage-strategies" aria-haspopup="dialog" aria-label="Share link: Storage Strategies"> Share link </button> </h4>1. Native Graph Storage Stores graph structure using adjacency lists or similar graph-native formats (Geode, Neo4j). Advantages: <ul> <li>Optimized for traversals</li> <li>Index-free adjacency (no joins needed)</li> <li>High performance for graph queries</li> </ul> 2. Non-Native Storage Uses relational or document storage underneath with graph abstraction layer. Advantages: <ul> <li>Leverages existing database infrastructure</li> <li>Familiar backup/recovery tools</li> </ul> Disadvantages: <ul> <li>Slower traversals (requires joins)</li> <li>Limited scalability for deep queries</li> </ul> <h4 id="query-processing" class="position-relative d-flex align-items-center group"> Query Processing <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="query-processing" aria-haspopup="dialog" aria-label="Share link: Query Processing"> Share link </button> </h4>Graph Traversal Algorithms <ol> <li>Breadth-First Search (BFS): Explore neighbors level by level</li> <li>Depth-First Search (DFS): Explore deeply before backtracking</li> <li>Bidirectional Search: Search from both endpoints simultaneously</li> </ol> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- BFS implicitly used for shortest path MATCH path = SHORTEST (a:Person)-[:KNOWS*]-(b:Person) WHERE a.name = 'Alice' AND b.name = 'Bob' RETURN path; </code></pre></div>Index Usage Graph databases use indexes for: <ul> <li>Finding starting nodes (e.g., by property value)</li> <li>Filtering during traversal</li> <li>Accelerating aggregations</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Index scan to find starting node CREATE INDEX person_name ON Person(name); -- Query uses index to find 'Alice', then traverses MATCH (a:Person {name: 'Alice'})-[:KNOWS*2..3]->(friend) RETURN friend.name; </code></pre></div> <h3 id="graph-query-languages" class="position-relative d-flex align-items-center group"> Graph Query Languages <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="graph-query-languages" aria-haspopup="dialog" aria-label="Share link: Graph Query Languages"> Share link </button> </h3> <h4 id="gql-graph-query-language" class="position-relative d-flex align-items-center group"> GQL (Graph Query Language) <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="gql-graph-query-language" aria-haspopup="dialog" aria-label="Share link: GQL (Graph Query Language)"> Share link </button> </h4>ISO/IEC 39075:2024 standard implemented by Geode. Advantages: <ul> <li>International standard (like SQL for relational)</li> <li>Vendor-neutral</li> <li>Modern design (learned from SQL, Cypher, SPARQL)</li> <li>Pattern matching syntax</li> <li>Strong typing</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- GQL syntax MATCH (a:Person)-[r:KNOWS]->(b:Person) WHERE a.age > 30 RETURN a.name, b.name, r.since; </code></pre></div> <h4 id="cypher" class="position-relative d-flex align-items-center group"> Cypher <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="cypher" aria-haspopup="dialog" aria-label="Share link: Cypher"> Share link </button> </h4>Neo4j’s proprietary language (influenced GQL). <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-fallback" data-lang="fallback">-- Cypher syntax (very similar to GQL) MATCH (a:Person)-[r:KNOWS]->(b:Person) WHERE a.age > 30 RETURN a.name, b.name, r.since </code></pre></div> <h4 id="gremlin" class="position-relative d-flex align-items-center group"> Gremlin <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="gremlin" aria-haspopup="dialog" aria-label="Share link: Gremlin"> Share link </button> </h4>Apache TinkerPop’s imperative traversal language. <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-groovy" data-lang="groovy">// Gremlin syntax (procedural) g.V().hasLabel('Person') .has('age', gt(30)) .outE('KNOWS') .inV() .path() </code></pre></div> <h4 id="sparql" class="position-relative d-flex align-items-center group"> SPARQL <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="sparql" aria-haspopup="dialog" aria-label="Share link: SPARQL"> Share link </button> </h4>W3C standard for RDF/semantic graphs. <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-sparql" data-lang="sparql"># SPARQL syntax (for RDF triples) SELECT ?aName ?bName ?since WHERE { ?a rdf:type :Person . ?a :knows ?b . ?a :age ?age . ?a :name ?aName . ?b :name ?bName . FILTER (?age > 30) } </code></pre></div> <h3 id="comparison-with-other-database-types" class="position-relative d-flex align-items-center group"> Comparison with Other Database Types <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="comparison-with-other-database-types" aria-haspopup="dialog" aria-label="Share link: Comparison with Other Database Types"> Share link </button> </h3> <h4 id="vs-relational-databases-sql" class="position-relative d-flex align-items-center group"> vs. Relational Databases (SQL) <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="vs-relational-databases-sql" aria-haspopup="dialog" aria-label="Share link: vs. Relational Databases (SQL)"> Share link </button> </h4><table> <thead> <tr> <th>Aspect</th> <th>Graph DB</th> <th>Relational DB</th> </tr> </thead> <tbody> <tr> <td>Model</td> <td>Nodes and relationships</td> <td>Tables and foreign keys</td> </tr> <tr> <td>Relationships</td> <td>First-class citizens</td> <td>Represented by joins</td> </tr> <tr> <td>Schema</td> <td>Flexible (optional)</td> <td>Rigid (required)</td> </tr> <tr> <td>Joins</td> <td>Index-free adjacency</td> <td>Expensive JOIN operations</td> </tr> <tr> <td>Use Case</td> <td>Connected data queries</td> <td>Structured tabular data</td> </tr> <tr> <td>Performance</td> <td>Fast multi-hop traversals</td> <td>Slow for deep joins</td> </tr> </tbody> </table> Example: Find friends of friends <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Graph DB: natural and fast MATCH (me:Person {name: 'Alice'})-[:FRIEND]->(friend)-[:FRIEND]->(fof) WHERE fof <> me RETURN fof.name; </code></pre></div><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-sql" data-lang="sql">-- Relational: requires self-joins SELECT f2.name FROM persons me JOIN friendships f1 ON me.id = f1.person1_id JOIN persons friend ON f1.person2_id = friend.id JOIN friendships f2 ON friend.id = f2.person1_id JOIN persons fof ON f2.person2_id = fof.id WHERE me.name = 'Alice' AND fof.id <> me.id; </code></pre></div> <h4 id="vs-document-databases-mongodb-etc" class="position-relative d-flex align-items-center group"> vs. Document Databases (MongoDB, etc.) <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="vs-document-databases-mongodb-etc" aria-haspopup="dialog" aria-label="Share link: vs. Document Databases (MongoDB, etc.)"> Share link </button> </h4><table> <thead> <tr> <th>Aspect</th> <th>Graph DB</th> <th>Document DB</th> </tr> </thead> <tbody> <tr> <td>Relationships</td> <td>Explicit and navigable</td> <td>Embedded or referenced</td> </tr> <tr> <td>Queries</td> <td>Pattern matching</td> <td>Key-value or document lookup</td> </tr> <tr> <td>Consistency</td> <td>ACID (Geode)</td> <td>Eventual (most)</td> </tr> <tr> <td>Use Case</td> <td>Relationship-heavy</td> <td>Document-centric</td> </tr> </tbody> </table> Document DB Limitation: Relationships require application-level joins or denormalization. <h4 id="vs-key-value-stores-redis-dynamodb" class="position-relative d-flex align-items-center group"> vs. Key-Value Stores (Redis, DynamoDB) <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="vs-key-value-stores-redis-dynamodb" aria-haspopup="dialog" aria-label="Share link: vs. Key-Value Stores (Redis, DynamoDB)"> Share link </button> </h4><table> <thead> <tr> <th>Aspect</th> <th>Graph DB</th> <th>Key-Value Store</th> </tr> </thead> <tbody> <tr> <td>Data Model</td> <td>Complex graph</td> <td>Simple key-value pairs</td> </tr> <tr> <td>Query Power</td> <td>Rich pattern matching</td> <td>Get by key only</td> </tr> <tr> <td>Relationships</td> <td>First-class</td> <td>Not supported</td> </tr> <tr> <td>Performance</td> <td>Fast traversals</td> <td>Fastest single-key lookup</td> </tr> </tbody> </table> <h4 id="vs-other-graph-databases" class="position-relative d-flex align-items-center group"> vs. Other Graph Databases <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="vs-other-graph-databases" aria-haspopup="dialog" aria-label="Share link: vs. Other Graph Databases"> Share link </button> </h4>Geode vs. Neo4j <ul> <li>Standards: Geode uses GQL (ISO standard); Neo4j uses Cypher (proprietary)</li> <li>Architecture: Both native graph storage</li> <li>ACID: Both full ACID</li> <li>Licensing: Geode open-source Apache 2.0; Neo4j dual-licensed (GPL/commercial)</li> </ul> Geode vs. Amazon Neptune <ul> <li>Deployment: Geode on-premise or any cloud; Neptune AWS-only</li> <li>Query Language: Geode GQL; Neptune Gremlin/SPARQL</li> <li>Cost: Geode open-source; Neptune pay-per-instance</li> </ul> Geode vs. TigerGraph <ul> <li>Language: GQL vs. GSQL</li> <li>Performance: Both high-performance; different optimization strategies</li> <li>ACID: Geode full ACID; TigerGraph eventual consistency in distributed mode</li> </ul> <h3 id="acid-properties-in-graph-databases" class="position-relative d-flex align-items-center group"> ACID Properties in Graph Databases <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="acid-properties-in-graph-databases" aria-haspopup="dialog" aria-label="Share link: ACID Properties in Graph Databases"> Share link </button> </h3>Geode implements full ACID compliance: <ul> <li>Atomicity: Transactions are all-or-nothing</li> <li>Consistency: Data integrity constraints are enforced</li> <li>Isolation: Concurrent transactions don’t interfere</li> <li>Durability: Committed data persists across failures</li> </ul> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- ACID transaction example BEGIN TRANSACTION; INSERT (u:User {id: 'u123', balance: 1000}); INSERT (u2:User {id: 'u456', balance: 500}); -- Transfer money atomically MATCH (sender:User {id: 'u123'}), (receiver:User {id: 'u456'}) SET sender.balance = sender.balance - 100 SET receiver.balance = receiver.balance + 100; COMMIT; -- Either both updates happen, or neither does </code></pre></div> <h3 id="getting-started-with-graph-databases" class="position-relative d-flex align-items-center group"> Getting Started with Graph Databases <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="getting-started-with-graph-databases" aria-haspopup="dialog" aria-label="Share link: Getting Started with Graph Databases"> Share link </button> </h3> <h4 id="1-model-your-domain" class="position-relative d-flex align-items-center group"> 1. Model Your Domain <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="1-model-your-domain" aria-haspopup="dialog" aria-label="Share link: 1. Model Your Domain"> Share link </button> </h4>Identify entities (nodes) and relationships: <ul> <li>Entities: What are the “things” in your system?</li> <li>Relationships: How do these things connect?</li> <li>Properties: What attributes describe entities and relationships?</li> </ul> <h4 id="2-install-geode" class="position-relative d-flex align-items-center group"> 2. Install Geode <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="2-install-geode" aria-haspopup="dialog" aria-label="Share link: 2. Install Geode"> Share link </button> </h4><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-bash" data-lang="bash"># Download and start Geode cd geode make build geode serve --listen 0.0.0.0:3141 </code></pre></div> <h4 id="3-create-your-first-graph" class="position-relative d-flex align-items-center group"> 3. Create Your First Graph <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="3-create-your-first-graph" aria-haspopup="dialog" aria-label="Share link: 3. Create Your First Graph"> Share link </button> </h4><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Define your schema (optional in Geode) INSERT (alice:Person {name: 'Alice', age: 30}); INSERT (bob:Person {name: 'Bob', age: 28}); INSERT (alice)-[:KNOWS {since: DATE '2020-01-01'}]->(bob); </code></pre></div> <h4 id="4-query-your-graph" class="position-relative d-flex align-items-center group"> 4. Query Your Graph <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="4-query-your-graph" aria-haspopup="dialog" aria-label="Share link: 4. Query Your Graph"> Share link </button> </h4><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- Find Alice's friends MATCH (alice:Person {name: 'Alice'})-[:KNOWS]->(friend) RETURN friend.name, friend.age; </code></pre></div> <h4 id="5-explore-and-iterate" class="position-relative d-flex align-items-center group"> 5. Explore and Iterate <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="5-explore-and-iterate" aria-haspopup="dialog" aria-label="Share link: 5. Explore and Iterate"> Share link </button> </h4>Try different queries, add more data, experiment with patterns: <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-gql" data-lang="gql">-- More complex pattern MATCH (p:Person)-[:KNOWS]->(friend)-[:KNOWS]->(fof) WHERE p.name = 'Alice' AND fof <> p RETURN fof.name, count(*) AS connections ORDER BY connections DESC; </code></pre></div> <h3 id="best-practices" class="position-relative d-flex align-items-center group"> Best Practices <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="best-practices" aria-haspopup="dialog" aria-label="Share link: Best Practices"> Share link </button> </h3><ol> <li>Model Relationships Explicitly: Don’t hide relationships in properties</li> <li>Use Meaningful Relationship Types: <code>KNOWS</code> is better than <code>RELATED_TO</code></li> <li>Index Frequently Queried Properties: Speed up node lookups</li> <li>Avoid Dense Nodes: Nodes with millions of relationships can slow queries</li> <li>Use Parameterized Queries: Enable query plan caching</li> <li>Monitor Query Performance: Profile slow queries with PROFILE command</li> </ol> <h3 id="conclusion" class="position-relative d-flex align-items-center group"> Conclusion <button type="button" class="h-share btn btn-link p-0 text-decoration-none link-secondary opacity-50 hover-opacity-100 transition-all ms-1" data-share-target="conclusion" aria-haspopup="dialog" aria-label="Share link: Conclusion"> Share link </button> </h3>Graph databases represent a paradigm shift from traditional relational databases, offering natural modeling and efficient querying of connected data. Geode’s implementation of the ISO/IEC 39075:2024 GQL standard provides enterprise-grade graph capabilities with ACID guarantees, making it suitable for production workloads ranging from social networks to fraud detection to knowledge graphs. Explore the documentation below to dive deeper into specific aspects of graph database theory, architecture, and practical implementation with Geode.

Popular

Related Articles

Migrating from Neo4j to Geode