Hi. In my project I have PostgreSQL database as main DB and I need to keep synchronized my neo4j DB. To do so I wan to use Debezium for CDC, kafka and neo4j streams plugin. One of the reasons I prefer Debezium to jdbc is because it's real time. So at...
Hi! By using apoc.merge.relationship() function I expect that relationships should be identified only by identProps argument. So for Example if I update the relationshipType but provide same identProps I want to update the name of relationship and n...
Hi. Congratulations for new release! In release notes I have seen
TEXT indexes replace B-tree indexes for string queries.
which should provide
Improved performance of full text search when limit is specified
from github changelog. So my question ...
Hi. I am trying to implement fuzzy search for my nodes with their properties. I use db.index.fulltext.createNodeIndex() to create index and db.index.fulltext.queryNodes() to search. This works fine and I am able to do different kind of searches inclu...
I have data in object with this structure
[{
name:'here is name, which can have punctuation marks ',
value: 'here will be text '
},
{
name:'here is name, which can have punctuation marks ',
value: 'here will be text '
}]
I am trying to fin...
Thank you for your answer. So since now I can create property name with any symbol except backticks, I am curious if there is a way to have backticks in property name or label?
Seems like approach with backticks works only with property name and not ...
Hi Michael! Thank you for your replay. I already did it by JS and plus to what you said it gave me flexibility, for example to additionally do sum checking. I made the structure of query array
[
{
label: 'node Or Relationship Label Name',
p...
Hi Lju! Thank you for replay. Now I see why LIMIT is so fast.
What I want is to get subgraph (with limited nodes), which shows most important nodes and relationships in my graph. I don't want to adjust with bloom and browser, I want to do get the sub...
The problem was that I was searching for relationship without specifying nodes
match (m)-[p]-(n) return p
so it found same relationship for both m and n. To avoid this I had to specify at least one of nodes
match (m {name:'firstNode'})-[p]-(n) retur...
