Kiedy używać grafowej bazy danych, takiej jak Neo4j

A graph database represents data as nodes (entities) and edges (relationships between entities). Each edge is a first-class object with a type and its own properties. Unlike relational or document databases where relationships are implied by foreign keys or embedded references, graph databases store relationships as explicit connections with O(1) traversal per hop — following a relationship takes constant time regardless of database size.

Document and relational databases are optimised for finding entities — fetch a user by ID, query orders by status. They struggle with traversing relationships — 'find all friends of Alice's friends who bought the same product as Alice within the last month'. Each hop requires a $lookup or JOIN. Three hops deep means three nested joins. At 10 hops across millions of nodes, MongoDB's performance degrades exponentially while Neo4j's stays flat.

Neo4j is the most popular graph database, using the Cypher query language — a declarative, pattern-based language for graph traversal. A Cypher query describes the graph pattern you are looking for using ASCII-art notation: nodes in (), relationships in -[]->. The query engine finds all subgraphs matching the pattern efficiently using native index-free adjacency.

Recommendation systems depend on traversing relationship networks: 'users who bought what you bought also bought X'. In a graph, each purchase is an edge between a user node and a product node. Finding collaborative filter recommendations is a 2-hop traversal: User → Product → (other Users who bought that Product) → (other Products those Users bought). Neo4j handles millions of such traversals per second. MongoDB's $graphLookup can do this but degrades at scale.

Fraud rings often involve shared identity information: multiple accounts sharing the same device ID, phone number, IP address, or billing address. Graph databases excel at detecting these rings by traversing the relationships: 'find all accounts connected to this suspicious account through shared attributes within 3 hops'. Real-time fraud scoring at transaction time — querying a graph across millions of linked entities in milliseconds — is a native strength of Neo4j that MongoDB cannot match.

A knowledge graph models entities and their semantic relationships — like Wikipedia's information structured as a graph. Knowledge graphs power search engine entity recognition, AI assistants' factual answering, and enterprise ontologies. The graph model fits naturally: Person knows Person, Person worksAt Company, Company isLocatedIn City, City isCapitalOf Country. Traversing these semantic chains is what graph databases are built for.

Not every graph problem needs Neo4j. MongoDB's $graphLookup handles tree and graph traversals reasonably well for: shallow hierarchies (fewer than 5–6 hops); modest graph sizes (thousands to low millions of nodes); and infrequent traversal queries that can afford higher latency. If graph queries are a secondary feature of an application primarily built around document data, keeping everything in MongoDB simplifies the stack considerably.

Choose Neo4j (or another graph database) when: deep multi-hop traversals are a core feature (social networks, knowledge graphs, fraud detection); the relationship itself carries rich properties (e.g., a FOLLOWS edge storing when the follow happened and whether it is mutual); graph queries must return results in real time under high concurrency; or the entire domain is relationship-centric rather than entity-centric. For social media, identity graphs, network topology, and dependency graphs — reach for Neo4j.

Many large systems use polyglot persistence — different databases for different concerns. A social platform might store user profiles and posts in MongoDB (rich document queries), friendship and interest graphs in Neo4j (fast traversal), session data in Redis (sub-millisecond lookup), and analytics in a columnar store. Each database does what it is best at. The complexity is managing consistency across systems, but the performance and scalability gains often justify it.

In MongoDB, a social relationship is modelled as a document in a follows collection with followerId and followeeId fields. In Neo4j, it is a FOLLOWS edge directly connecting two User nodes. The graph model eliminates the intermediate collection and enables direct pointer-based traversal. The document model is better for fetching the user's profile data; the graph model is better for traversing their social connections.

Graph edges in Neo4j have a type (like a label) and can have properties. A social graph might have FOLLOWS, LIKES, PURCHASED, and REVIEWED edge types — each with their own properties. Cypher queries can match on edge type and filter on edge properties, enabling rich relationship queries. This is much more natural than storing a type field in a relationships collection in MongoDB and joining on it.

In this lesson you learned: graph databases like Neo4j excel at deep multi-hop relationship traversals — recommendation engines, fraud detection, knowledge graphs — where MongoDB's $lookup chains degrade exponentially, Neo4j's Cypher language expresses graph patterns declaratively in a way no document query language can match, and polyglot persistence using MongoDB for document data and Neo4j for relationship traversal is a common production pattern. Next up we tackle the capstone: designing a production-ready MongoDB application architecture.