ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Learn how Neo4j’s full‑text indexes, powered by Lucene, can turn slow text searches into millisecond queries. See a concrete example, trade‑offs, and a quick checklist to decide if you should adopt one in your graph.
SurrealDB offers record links and RELATE graph edges for modeling relationships. Here's a worked follow-graph example and a practical rule for choosing between them.
Learn how TAO’s cache‑backed MySQL store serves billions of graph reads with sub‑millisecond latency, and how to handle its eventual consistency in practice.
Stop writing complex JOINs. Learn how SurrealDB uses Record IDs and the FETCH clause to treat relationships as direct pointers, combining the speed of a document store with the power of a graph database.
Explore how Facebook's TAO handles billions of social graph edges using a read-through cache and write-behind MySQL sharding to achieve sub-millisecond latency.
Learn how to diagnose and fix 'Record Not Found' errors in SurrealDB, focusing on record ID formatting, FETCH clauses, and graph relation traversal.
Learn how Neo4j’s native full‑text indexes can cut query latency from seconds to milliseconds, what trade‑offs to watch for, and a step‑by‑step example that shows how to create, query, and monitor a full‑text index in a graph of millions of nodes.
Cypher's variable-length path patterns answer 'what's connected within N hops' in one line — but the hop bound and relationship-type filter are what stand between a fast query and a full-graph scan.
SurrealDB uses the FETCH clause to resolve record IDs into full objects, effectively flattening graph relationships into a single query response to minimize network round-trips. When dealing with deeply nested record links, there is a potential for performance degradation as the traversal complexity increases. It is unclear how the database manages memory an
facebook
surrealdb