Pencarian Teks Lengkap dan Vektor di Neo4j
Lampaui pencarian yang hanya mencocokkan secara tepat dengan menambahkan indeks teks penuh dan vektor ke Neo4j, sehingga memungkinkan pencarian teks samar dan kueri kemiripan semantik untuk kebutuhan pencarian serta kecerdasan buatan modern.
Pencarian Teks Lengkap dan Vektor di Neo4j adalah pelajaran Neo4j Graph Database Fundamentals gratis di CoddyKit. Ini adalah pelajaran 4 dari 4. Kamu bisa membaca pelajaran lengkapnya di bawah secara gratis — lalu praktikkan langsung di browser dengan editor kode bawaan dan tutor AI 24/7. Ini adalah bagian dari jalur belajar Neo4j Graph Database Fundamentals, dan progresmu tersinkronisasi di web dan aplikasi CoddyKit. Kursus Neo4j Graph Database Fundamentals mencakup 4 pelajaran total.
Bagian dari pelajaran ini belum diterjemahkan dan ditampilkan dalam bahasa Inggris.
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.
Pertanyaan yang Sering Diajukan
Apakah pelajaran “Pencarian Teks Lengkap dan Vektor di Neo4j” gratis?
Ya — teks lengkap “Pencarian Teks Lengkap dan Vektor di Neo4j” gratis dibaca di sini di web. Untuk praktiknya secara interaktif (editor kode bawaan dan tutor AI 24/7) dan buka sisa kursus Neo4j Graph Database Fundamentals, upgrade ke CoddyKit PRO. Kursus Neo4j Graph Database Fundamentals mencakup 4 pelajaran total.
Apa yang akan aku pelajari di “Pencarian Teks Lengkap dan Vektor di Neo4j”?
Lampaui pencarian yang hanya mencocokkan secara tepat dengan menambahkan indeks teks penuh dan vektor ke Neo4j, sehingga memungkinkan pencarian teks samar dan kueri kemiripan semantik untuk kebutuhan… Kamu berlatih Neo4j Graph Database Fundamentals dengan kode praktik yang langsung kamu jalankan di browser, dan tutor AI 24/7 menjawab pertanyaanmu saat kamu mengerjakan pelajaran ini.
Apakah aku perlu pengalaman untuk memulai Neo4j Graph Database Fundamentals?
Tidak diperlukan pengalaman sebelumnya. Neo4j Graph Database Fundamentals di CoddyKit dirancang untuk pemula hingga pelajar tingkat lanjut, jadi kamu bisa memulai di sini atau dari awal dan belajar sesuai kecepatan kamu sendiri. Ini adalah pelajaran 4 dari 4.
Berapa lama pelajaran “Pencarian Teks Lengkap dan Vektor di Neo4j” memakan waktu?
Sebagian besar pelajaran CoddyKit memakan waktu sekitar 5–10 menit. Setiap pelajaran ringkas dan interaktif, jadi kamu membuat kemajuan stabil dan melanjutkan dari tempat kamu tinggalkan di web dan aplikasi.
Bisakah aku menulis dan menjalankan kode dalam pelajaran Neo4j Graph Database Fundamentals ini?
Ya. Setiap pelajaran Neo4j Graph Database Fundamentals menyertakan editor kode bawaan, jadi kamu menulis dan menjalankan kode nyata langsung di browser dan mendapatkan umpan balik AI instan — tidak diperlukan penyiapan lokal.
Semua pelajaran dalam kursus ini
- Prosedur Tersimpan dan UDF
- Integrasi dengan Alat BI dan Visualisasi
- Pipeline Penyerapan Data Lanjutan
- Pencarian Teks Lengkap dan Vektor di Neo4j