Full-Text and Vector Search in Neo4j
Go beyond exact-match lookups by adding full-text and vector indexes to Neo4j, enabling fuzzy text search and semantic similarity queries that extend the database for modern search and AI workloads.
Full-Text and Vector Search in Neo4j is a free Neo4j Graph Database Fundamentals lesson on CoddyKit — lesson 4 of 4. You can read the complete lesson below for free — then practise it hands-on in the browser with a built-in code editor and a 24/7 AI tutor. It is part of the Neo4j Graph Database Fundamentals learning path, one of 4 lessons in the course, and your progress syncs across the web and the CoddyKit app.
Why Search Indexes Matter
Plain property lookups in Neo4j are great for exact matches, but real applications need more. Users misspell words, search across multiple fields, and increasingly expect semantic results.
Neo4j extends its capabilities with two specialized index types:
- Full-text indexes for fuzzy, multi-field text search
- Vector indexes for similarity search over embeddings
Both are first-class features you can manage with Cypher.
Creating a Full-Text Index
A full-text index is built over one or more node labels and properties. Once created, it powers tokenized, case-insensitive search.
The example creates an index named movieSearch over the title and plot properties of Movie nodes.
CREATE FULLTEXT INDEX movieSearch
FOR (m:Movie)
ON EACH [m.title, m.plot];Querying a Full-Text Index
You query full-text indexes with the db.index.fulltext.queryNodes procedure. It returns matching nodes plus a relevance score.
This Lucene-style syntax supports wildcards, fuzzy matching with ~, and boolean operators.
CALL db.index.fulltext.queryNodes('movieSearch', 'matrix~')
YIELD node, score
RETURN node.title AS title, score
ORDER BY score DESC;Fuzzy and Wildcard Matching
Full-text search shines with imperfect input. A few common operators:
star~— fuzzy match, tolerates typosstar*— prefix wildcardtitle:matrix— restrict to one fieldmatrix AND reloaded— boolean combination
These let one query handle the messy real-world queries users actually type.
CALL db.index.fulltext.queryNodes('movieSearch', 'title:matr*')
YIELD node, score
RETURN node.title, score;What Are Vector Embeddings?
A vector embedding is a list of numbers that captures the meaning of text, an image, or other data. Items with similar meaning have vectors that point in similar directions.
By storing an embedding as a property on a node, Neo4j can answer questions like find the documents most semantically similar to this one — not just keyword matches.
Creating a Vector Index
Vector indexes require you to declare the dimension (length of the embedding) and the similarity function (cosine or euclidean).
The db.index.vector.createNodeIndex procedure creates one over a label and property. Here we index a 1536-dimension embedding stored on Document nodes.
CALL db.index.vector.createNodeIndex(
'docEmbedding',
'Document',
'embedding',
1536,
'cosine'
);Storing an Embedding on a Node
Embeddings are usually produced by an external model and written back to Neo4j. The db.create.setNodeVectorProperty procedure stores the float array efficiently.
In practice the array has hundreds or thousands of values; it is shortened here for readability.
MATCH (d:Document {id: 'doc-1'})
CALL db.create.setNodeVectorProperty(d, 'embedding', [0.12, -0.04, 0.88])
RETURN d.id;Querying for Similar Nodes
To find the nearest neighbors, call db.index.vector.queryNodes with the index name, the number of results, and a query vector.
It returns nodes ordered by similarity along with a score between 0 and 1.
CALL db.index.vector.queryNodes('docEmbedding', 5, [0.10, -0.02, 0.90])
YIELD node, score
RETURN node.title AS title, score
ORDER BY score DESC;Combining Search with the Graph
The real power of Neo4j is mixing search with traversal. You can find semantically similar documents, then follow relationships to enrich the results.
This query finds similar documents and returns their authors — something a pure vector database cannot do in one step.
CALL db.index.vector.queryNodes('docEmbedding', 3, [0.1, -0.02, 0.9])
YIELD node, score
MATCH (node)<-[:WROTE]-(a:Author)
RETURN node.title, a.name, score;Managing Search Indexes
Like any index, full-text and vector indexes can be listed and dropped. Use SHOW INDEXES to inspect them and DROP INDEX to remove one.
Always check that an index is ONLINE before relying on it in production queries.
SHOW INDEXES
WHERE type IN ['FULLTEXT', 'VECTOR'];
// Remove one:
DROP INDEX docEmbedding IF EXISTS;Best Practices
To get the most from search indexes:
- Keep embedding dimensions consistent with your model output
- Choose
cosinesimilarity for most text embeddings - Re-embed and update vectors when source data changes
- Limit result counts and post-filter with Cypher for relevance
These habits keep searches fast and accurate as data grows.
Quick Check
Test your understanding of Neo4j search indexes.
Recap
You extended Neo4j with two powerful search capabilities:
- Full-text indexes — tokenized, fuzzy, multi-field keyword search via
db.index.fulltext.queryNodes - Vector indexes — semantic similarity over embeddings via
db.index.vector.queryNodes
Best of all, both integrate with graph traversals, letting you blend search relevance with relationship context in a single Cypher query.
Frequently asked questions
Is the “Full-Text and Vector Search in Neo4j” lesson free?
Yes — the full text of “Full-Text and Vector Search in Neo4j” is free to read here on the web, and the Neo4j Graph Database Fundamentals course includes 4 lessons in total. To practise it interactively (a built-in code editor and a 24/7 AI tutor) and unlock the rest of the Neo4j Graph Database Fundamentals course, upgrade to CoddyKit PRO.
What will I learn in “Full-Text and Vector Search in Neo4j”?
Go beyond exact-match lookups by adding full-text and vector indexes to Neo4j, enabling fuzzy text search and semantic similarity queries that extend the database for modern search and AI workloads. You practise Neo4j Graph Database Fundamentals with hands-on code you run directly in the browser, and a 24/7 AI tutor answers your questions as you work through the lesson.
Do I need any experience to start Neo4j Graph Database Fundamentals?
No prior experience is required. Neo4j Graph Database Fundamentals on CoddyKit is structured for beginners through advanced learners; this is — lesson 4 of 4, so you can start here or from the beginning and move at your own pace.
How long does the “Full-Text and Vector Search in Neo4j” lesson take?
Most CoddyKit lessons take about 5–10 minutes. Each one is bite-sized and interactive, so you make steady progress and pick up exactly where you left off across the web and the app.
Can I write and run code in this Neo4j Graph Database Fundamentals lesson?
Yes. Every Neo4j Graph Database Fundamentals lesson includes a built-in code editor, so you write and run real code right in your browser and get instant AI feedback — no local setup required.
All lessons in this course
- Stored Procedures and UDFs
- Integrating with BI and Visualization Tools
- Advanced Data Ingestion Pipelines
- Full-Text and Vector Search in Neo4j