| Index-Free Adjacency Graph Data Modeling & Schema Design | Architects native pointer-based graph topologies with optimized label hierarchies and relationship types, exploiting double-linked record pointers for constant O(1) traversals without relational JOIN bottlenecks. | Treats Neo4j like a relational database; over-indexes node properties and models many-to-many relationships with intermediate join nodes, defeating index-free adjacency benefits. | Directly mirrors third-normal-form (3NF) relational tables into graph nodes and foreign-key edges, introducing severe traversal overhead and pointer dereferencing bottlenecks. | Stores denormalized monolithic JSON payloads inside node properties and uses arbitrary undirected relationships, resulting in unpruned graph traversals. |
| Declarative Cypher PROFILE / EXPLAIN Query Execution Plans | Audits PROFILE and EXPLAIN execution plans down to db-hits, operators (ExpandAll, CartesianProduct, Eager), and memory allocations to eliminate unindexed scans and ensure pipeline streaming. | Rely on basic Cypher syntax without inspecting execution trees, missing expensive Eager operators that break streaming execution and inflate JVM heap memory. | Writes unparameterized Cypher queries causing continuous query cache churn and compilation latency, or falls back to client-side iteration loops. | Employs unbounded variable-length traversals (e.g. -[*]-) without path limits or directional constraints, triggering accidental full-graph traversals. |
| Supernode Degree Explosion Mitigation & Relationship Grouping | Implements fan-out partitioning, relationship directionality, categorization, and intermediate grouping nodes to cap traversal branch factors on 100k+ degree hub nodes. | Leaves high-degree supernodes unmitigated, resulting in traversal thread lockups, severe GC pauses, and multi-second P99 query latency degradation. | Recommends vertical RAM upgrades rather than addressing graph topology skew, relationship group indexing, or direction-specific edge typing. | Attempts client-side filtering on all incoming edges of dense nodes, triggering JVM out-of-memory crashes during relationship expansion. |
| Graph Data Science (GDS) In-Memory Projection Sizing | Calculates exact off-heap projected graph memory requirements for PageRank, Louvain, and GraphSAGE embeddings, tuning concurrency threads and write-back pipelines without starving core DBMS heap. | Executes GDS graph projections directly on production transactional cluster members without memory bounds, causing garbage collection stalls and Raft heartbeat drops. | Lacks understanding of GDS in-memory graph projections; exports graph dumps to run external Python/NetworkX scripts via slow BOLT queries. | Allocates arbitrary JVM heap to GDS projections without configuring G1GC regions, triggering fatal OutOfMemoryError crashes. |
| Autonomous Clustering Raft Consensus & Read Replica Balancing | Architects Neo4j 5+ Autonomous Clustering with dedicated Raft consensus groups, dynamic database allocation, and routing-aware Neo4j driver configurations across primary and secondary servers. | Maintains legacy Causal Cluster configurations with static core/read-replica topologies, failing to leverage autonomous database reassignment and server tags. | Deploys standalone single-instance VMs with asynchronous file backups, providing zero automated failover or cross-zone high availability. | Connects applications directly to specific cluster member endpoints without routing drivers, leading to write failures during leader re-election. |
| Neo4j AuraDB Enterprise vs Self-Managed TCO Sizing | Delivers comprehensive TCO modeling comparing AuraDB Enterprise vs self-managed on Kubernetes (Neo4j Helm/Operator), evaluating JVM pagecache ratios, backup I/O, and cloud infrastructure licensing. | Over-provisions self-managed cloud instances with idle compute and miscalculated disk IOPS, incurring high operational maintenance overhead. | Pushes proprietary managed services without evaluating data transfer egress costs, compliance boundaries (SOC 2, HIPAA), or long-term growth curve. | Selects low-tier AuraDB instances without sizing off-heap pagecache for working-set graph storage, triggering continuous disk I/O thrashing. |