›Scores and Graph Traversal
1.5 · Lesson
Scores and Graph Traversal
A full-text search returns matching iFull definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. and a relevance score, but a node on its own is rarely the complete answer. In a graph database, the value comes from the connections. A movie search result is more useful when it includes the cast, the director, and how relevant the match is.
You already know that higher scores mean stronger matches and that you can filter by score using WHERE. But why does one result score higher than another?
Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register