ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Diagnose and fix SurrealDB graph traversal latency by identifying missing indexes, analyzing query plans with EXPLAIN, and applying targeted indexing strategies for RELATE and FETCH operations.
Stop fighting complex SQL JOINs. Learn how SurrealDB uses Record Links and Graph Relations to traverse data paths efficiently with a single query.
SurrealDB lets you replace costly JOINs with lightweight record links and graph operators. Learn how to model relationships, fetch linked data in one query, and avoid over‑fetching pitfalls with a practical example.
Learn how Neo4j’s GDS graph projection lets you run algorithms like PageRank on a snapshot of your data, and discover the memory and staleness trade‑offs you need to manage.
Facebook's TAO replaces SQL joins with a denormalized association model—accepting write amplification to make social graph reads single-shard and cache-friendly. Here's how the trade-off works, where it breaks, and how to evaluate it for your own workload.
Stop managing cumbersome join tables. Learn how to use SurrealDB Record Links and Graph Edges to simplify your schema and perform high-performance data traversals.
Learn how to diagnose and fix 'Record Not Found' errors and empty result sets in SurrealDB graph traversals, focusing on directionality, FETCH clauses, and permissions.
Neo4j's native full-text indexes turn O(N) property scans into sub-millisecond lookups for text predicates. This post covers creation, query patterns, a concrete benchmark, and the trade-offs (eventual consistency, storage growth) that determine when to stay native vs. offload to Elasticsearch.
SurrealDB's record links and RELATE edges replace join tables with native graph relationships — here's a worked example, plus the referential integrity trade-off you need to plan for.
surrealdb
neo4j