-
Notifications
You must be signed in to change notification settings - Fork 740
Expand file tree
/
Copy pathneo4j_example.py
More file actions
637 lines (566 loc) · 23.6 KB
/
neo4j_example.py
File metadata and controls
637 lines (566 loc) · 23.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
import os
from datetime import datetime
from dotenv import load_dotenv
from memos.configs.embedder import EmbedderConfigFactory
from memos.configs.graph_db import GraphDBConfigFactory
from memos.embedders.factory import EmbedderFactory
from memos.graph_dbs.factory import GraphStoreFactory
from memos.memories.textual.item import TextualMemoryItem, TreeNodeTextualMemoryMetadata
load_dotenv()
NEO4J_URI = os.getenv("NEO4J_URI", "bolt://localhost:7687")
NEO4J_USER = os.getenv("NEO4J_USER", "neo4j")
NEO4J_PASSWORD = os.getenv("NEO4J_PASSWORD", "12345678")
NEO4J_DB_NAME = os.getenv("NEO4J_DB_NAME", "neo4j")
EMBEDDING_DIMENSION = int(os.getenv("EMBEDDING_DIMENSION", "3072"))
QDRANT_HOST = os.getenv("QDRANT_HOST", "localhost")
QDRANT_PORT = int(os.getenv("QDRANT_PORT", "6333"))
embedder_config = EmbedderConfigFactory.model_validate(
{
"backend": os.getenv("MOS_EMBEDDER_BACKEND", "universal_api"),
"config": {
"provider": os.getenv("MOS_EMBEDDER_PROVIDER", "openai"),
"api_key": os.getenv("MOS_EMBEDDER_API_KEY", os.getenv("OPENAI_API_KEY", "")),
"model_name_or_path": os.getenv("MOS_EMBEDDER_MODEL", "text-embedding-3-large"),
"base_url": os.getenv(
"MOS_EMBEDDER_API_BASE", os.getenv("OPENAI_API_BASE", "https://api.openai.com/v1")
),
},
}
)
embedder = EmbedderFactory.from_config(embedder_config)
def embed_memory_item(memory: str) -> list[float]:
return embedder.embed([memory])[0]
def get_neo4j_graph(db_name: str = "paper"):
config = GraphDBConfigFactory(
backend="neo4j",
config={
"uri": NEO4J_URI,
"user": NEO4J_USER,
"password": NEO4J_PASSWORD,
"db_name": db_name,
"auto_create": True,
"embedding_dimension": EMBEDDING_DIMENSION,
"use_multi_db": True,
},
)
graph = GraphStoreFactory.from_config(config)
return graph
def example_multi_db(db_name: str = "paper"):
# Step 1: Build factory config
config = GraphDBConfigFactory(
backend="neo4j",
config={
"uri": NEO4J_URI,
"user": NEO4J_USER,
"password": NEO4J_PASSWORD,
"db_name": db_name,
"auto_create": True,
"embedding_dimension": EMBEDDING_DIMENSION,
"use_multi_db": True,
},
)
# Step 2: Instantiate the graph store
graph = GraphStoreFactory.from_config(config)
graph.clear()
# Step 3: Create topic node
topic = TextualMemoryItem(
memory="This research addresses long-term multi-UAV navigation for energy-efficient communication coverage.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="Multi-UAV Long-Term Coverage",
hierarchy_level="topic",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/intro"],
status="activated",
confidence=95.0,
tags=["UAV", "coverage", "multi-agent"],
entities=["UAV", "coverage", "navigation"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"This research addresses long-term "
"multi-UAV navigation for "
"energy-efficient communication "
"coverage."
),
),
)
graph.add_node(
id=topic.id, memory=topic.memory, metadata=topic.metadata.model_dump(exclude_none=True)
)
# Step 4: Define and write concept nodes
concepts = [
TextualMemoryItem(
memory="The reward function combines multiple objectives: coverage maximization, energy consumption minimization, and overlap penalty.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="Reward Function Design",
hierarchy_level="concept",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/reward"],
status="activated",
confidence=92.0,
tags=["reward", "DRL", "multi-objective"],
entities=["reward function"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"The reward function combines "
"multiple objectives: coverage "
"maximization, energy consumption "
"minimization, and overlap penalty."
),
),
),
TextualMemoryItem(
memory="The energy model considers transmission power and mechanical movement power consumption.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="Energy Model",
hierarchy_level="concept",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/energy"],
status="activated",
confidence=90.0,
tags=["energy", "power model"],
entities=["energy", "power"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"The energy model considers "
"transmission power and mechanical movement power consumption."
),
),
),
TextualMemoryItem(
memory="Coverage performance is measured using CT (Coverage Time) and FT (Fairness Time) metrics.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="Coverage Metrics",
hierarchy_level="concept",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/metrics"],
status="activated",
confidence=91.0,
tags=["coverage", "fairness", "metrics"],
entities=["CT", "FT"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"The energy model considers "
"transmission power and mechanical movement power consumption."
),
),
),
]
# Step 5: Write and link concepts to topic
for concept in concepts:
graph.add_node(
id=concept.id,
memory=concept.memory,
metadata=concept.metadata.model_dump(exclude_none=True),
)
graph.add_edge(source_id=concept.id, target_id=topic.id, type="RELATED")
print(f"Creating edge: ({concept.id}) -[:{type}]-> ({topic.id})")
# Define concept → fact
fact_pairs = [
{
"concept_key": "Reward Function Design",
"fact": TextualMemoryItem(
memory="The reward includes three parts: (1) coverage gain, (2) energy penalty, and (3) penalty for overlapping areas with other UAVs.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="WorkingMemory",
key="Reward Components",
hierarchy_level="fact",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/reward-details"],
status="activated",
confidence=90.0,
tags=["reward", "overlap", "multi-agent"],
entities=["coverage", "energy", "overlap"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"The reward includes three parts: (1) coverage gain, (2) energy penalty, and (3) penalty for overlapping areas with other UAVs."
),
),
),
},
{
"concept_key": "Energy Model",
"fact": TextualMemoryItem(
memory="Total energy cost is calculated from both mechanical movement and communication transmission.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="Energy Cost Components",
hierarchy_level="fact",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/energy-detail"],
status="activated",
confidence=89.0,
tags=["energy", "movement", "transmission"],
entities=["movement power", "transmission power"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"Total energy cost is calculated from both mechanical movement and communication transmission."
),
),
),
},
{
"concept_key": "Coverage Metrics",
"fact": TextualMemoryItem(
memory="CT measures how long the area is covered; FT reflects the fairness of agent coverage distribution.",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="CT and FT Definition",
hierarchy_level="fact",
type="fact",
memory_time="2024-01-01",
source="file",
sources=["paper://multi-uav-coverage/metric-definitions"],
status="activated",
confidence=91.0,
tags=["CT", "FT", "fairness"],
entities=["coverage time", "fairness"],
visibility="public",
updated_at=datetime.now().isoformat(),
embedding=embed_memory_item(
"CT measures how long the area is covered; FT reflects the fairness of agent coverage distribution."
),
),
),
},
]
# Write facts and link to corresponding concept by key
concept_map = {concept.metadata.key: concept.id for concept in concepts}
for pair in fact_pairs:
fact_item = pair["fact"]
concept_key = pair["concept_key"]
concept_id = concept_map[concept_key]
graph.add_node(
fact_item.id,
fact_item.memory,
metadata=fact_item.metadata.model_dump(exclude_none=True),
)
graph.add_edge(source_id=fact_item.id, target_id=concept_id, type="BELONGS_TO")
all_graph_data = graph.export_graph()
print(all_graph_data)
nodes = graph.search_by_embedding(vector=embed_memory_item("what does FT reflect?"), top_k=1)
for node_i in nodes:
print(graph.get_node(node_i["id"]))
def example_shared_db(db_name: str = "shared-traval-group"):
"""
Example: Single(Shared)-DB multi-tenant (logical isolation)
Multiple users' data in the same Neo4j DB with user_name as a tag.
"""
# users
user_list = ["travel_member_alice", "travel_member_bob"]
for user_name in user_list:
# Step 1: Build factory config
config = GraphDBConfigFactory(
backend="neo4j",
config={
"uri": NEO4J_URI,
"user": NEO4J_USER,
"password": NEO4J_PASSWORD,
"db_name": db_name,
"user_name": user_name,
"use_multi_db": False,
"auto_create": True,
"embedding_dimension": EMBEDDING_DIMENSION,
},
)
# Step 2: Instantiate graph store
graph = GraphStoreFactory.from_config(config)
print(f"\n[INFO] Working in shared DB: {db_name}, for user: {user_name}")
graph.clear()
# Step 3: Create topic node
topic = TextualMemoryItem(
memory=f"Travel notes for {user_name}",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
hierarchy_level="topic",
status="activated",
visibility="public",
embedding=embed_memory_item(f"Travel notes for {user_name}"),
),
)
graph.add_node(
id=topic.id, memory=topic.memory, metadata=topic.metadata.model_dump(exclude_none=True)
)
# Step 4: Add a concept for each user
concept = TextualMemoryItem(
memory=f"Itinerary plan for {user_name}",
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
hierarchy_level="concept",
status="activated",
visibility="public",
embedding=embed_memory_item(f"Itinerary plan for {user_name}"),
),
)
graph.add_node(
id=concept.id,
memory=concept.memory,
metadata=concept.metadata.model_dump(exclude_none=True),
)
# Link concept to topic
graph.add_edge(source_id=concept.id, target_id=topic.id, type="INCLUDE")
print(f"[INFO] Added nodes for {user_name}")
# Step 5: Query and print ALL for verification
print("\n=== Export entire DB (for verification, includes ALL users) ===")
graph = GraphStoreFactory.from_config(config)
all_graph_data = graph.export_graph()
print(all_graph_data)
# Step 6: Search for alice's data only
print("\n=== Search for travel_member_alice ===")
config_alice = GraphDBConfigFactory(
backend="neo4j",
config={
"uri": NEO4J_URI,
"user": NEO4J_USER,
"password": NEO4J_PASSWORD,
"db_name": db_name,
"user_name": user_list[0],
"embedding_dimension": EMBEDDING_DIMENSION,
},
)
graph_alice = GraphStoreFactory.from_config(config_alice)
nodes = graph_alice.search_by_embedding(vector=embed_memory_item("travel itinerary"), top_k=1)
for node in nodes:
print(graph_alice.get_node(node["id"]))
def run_user_session(
user_name: str,
db_name: str,
topic_text: str,
concept_texts: list[str],
fact_texts: list[str],
community: bool = False,
):
print(f"\n=== {user_name} starts building their memory graph ===")
# Manually initialize correct GraphDB class
if community:
config = GraphDBConfigFactory(
backend="neo4j-community",
config={
"uri": NEO4J_URI,
"user": NEO4J_USER,
"password": NEO4J_PASSWORD,
"db_name": db_name,
"user_name": user_name,
"use_multi_db": False,
"auto_create": False,
"embedding_dimension": EMBEDDING_DIMENSION,
"vec_config": {
"backend": "qdrant",
"config": {
"collection_name": "neo4j_vec_db",
"vector_dimension": EMBEDDING_DIMENSION,
"distance_metric": "cosine",
"host": QDRANT_HOST,
"port": QDRANT_PORT,
},
},
},
)
else:
config = GraphDBConfigFactory(
backend="neo4j",
config={
"uri": NEO4J_URI,
"user": NEO4J_USER,
"password": NEO4J_PASSWORD,
"db_name": db_name,
"user_name": user_name,
"use_multi_db": False,
"auto_create": True,
"embedding_dimension": EMBEDDING_DIMENSION,
},
)
graph = GraphStoreFactory.from_config(config)
# Start with a clean slate for this user
graph.clear()
now = datetime.utcnow().isoformat()
# === Step 1: Create a root topic node (e.g., user's research focus) ===
topic = TextualMemoryItem(
memory=topic_text,
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key="Research Topic",
hierarchy_level="topic",
type="fact",
memory_time="2024-01-01",
status="activated",
visibility="public",
updated_at=now,
embedding=embed_memory_item(topic_text),
),
)
graph.add_node(topic.id, topic.memory, topic.metadata.model_dump(exclude_none=True))
# === Step 2: Create two concept nodes linked to the topic ===
concept_items = []
for i, text in enumerate(concept_texts):
concept = TextualMemoryItem(
memory=text,
metadata=TreeNodeTextualMemoryMetadata(
memory_type="LongTermMemory",
key=f"Concept {i + 1}",
hierarchy_level="concept",
type="fact",
memory_time="2024-01-01",
status="activated",
visibility="public",
updated_at=now,
embedding=embed_memory_item(text),
tags=["concept"],
confidence=90 + i,
),
)
graph.add_node(concept.id, concept.memory, concept.metadata.model_dump(exclude_none=True))
graph.add_edge(topic.id, concept.id, type="PARENT")
concept_items.append(concept)
# === Step 3: Create supporting facts under each concept ===
for i, text in enumerate(fact_texts):
fact = TextualMemoryItem(
memory=text,
metadata=TreeNodeTextualMemoryMetadata(
memory_type="WorkingMemory",
key=f"Fact {i + 1}",
hierarchy_level="fact",
type="fact",
memory_time="2024-01-01",
status="activated",
visibility="public",
updated_at=now,
embedding=embed_memory_item(text),
confidence=85.0,
tags=["fact"],
),
)
graph.add_node(fact.id, fact.memory, fact.metadata.model_dump(exclude_none=True))
graph.add_edge(concept_items[i % len(concept_items)].id, fact.id, type="PARENT")
# === Step 4: Retrieve memory using semantic search ===
vector = embed_memory_item("How is memory retrieved?")
search_result = graph.search_by_embedding(vector, top_k=2)
for r in search_result:
node = graph.get_node(r["id"])
print("🔍 Search result:", node["memory"])
# === Step 5: Tag-based neighborhood discovery ===
neighbors = graph.get_neighbors_by_tag(["concept"], exclude_ids=[], top_k=2)
print("📎 Tag-related nodes:", [neighbor["memory"] for neighbor in neighbors])
# === Step 6: Retrieve children (facts) of first concept ===
children = graph.get_children_with_embeddings(concept_items[0].id)
print("📍 Children of concept:", [child["memory"] for child in children])
# === Step 7: Export a local subgraph and grouped statistics ===
subgraph = graph.get_subgraph(topic.id, depth=2)
print("📌 Subgraph node count:", len(subgraph["neighbors"]))
stats = graph.get_grouped_counts(["memory_type", "status"])
print("📊 Grouped counts:", stats)
# === Step 8: Demonstrate updates and cleanup ===
graph.update_node(concept_items[0].id, {"confidence": 99.0})
graph.remove_oldest_memory("WorkingMemory", keep_latest=1)
graph.delete_edge(topic.id, concept_items[0].id, type="PARENT")
graph.delete_node(concept_items[1].id)
# === Step 9: Export and re-import the entire graph structure ===
exported = graph.export_graph()
graph.import_graph(exported)
print("📦 Graph exported and re-imported, total nodes:", len(exported["nodes"]))
def example_complex_shared_db(db_name: str = "shared-traval-group-complex", community=False):
# User 1: Alice explores structured memory for LLMs
run_user_session(
user_name="alice",
db_name=db_name,
topic_text="Alice studies structured memory and long-term memory optimization in LLMs.",
concept_texts=[
"Short-term memory can be simulated using WorkingMemory blocks.",
"A structured memory graph improves retrieval precision for agents.",
],
fact_texts=[
"Embedding search is used to find semantically similar memory items.",
"User memories are stored as node-edge structures that support hierarchical reasoning.",
],
community=community,
)
# User 2: Bob focuses on GNN-based reasoning
run_user_session(
user_name="bob",
db_name=db_name,
topic_text="Bob investigates how graph neural networks can support knowledge reasoning.",
concept_texts=[
"GNNs can learn high-order relations among entities.",
"Attention mechanisms in graphs improve inference precision.",
],
fact_texts=[
"GAT outperforms GCN in graph classification tasks.",
"Multi-hop reasoning helps answer complex queries.",
],
community=community,
)
def example_complex_shared_db_search_filter(db):
embedding = embed_memory_item(
"The reward function combines "
"multiple objectives: coverage "
"maximization, energy consumption "
)
print(f"get_node:{db.get_node(id='5364c28e-1e4b-485a-b1d5-1ba11bc5bc8b')}")
filter_id = {"id": "a269f2bf-f4a2-43b9-aa8d-1cb2a2eb4691"}
print(f"==filter_id:{db.search_by_embedding(vector=embedding, filter=filter_id)}")
filter_and_params = {
"and": [{"id": "a269f2bf-f4a2-43b9-aa8d-1cb2a2eb4691"}, {"source": "file123"}]
}
print(
f"==filter_and_params:{db.search_by_embedding(vector=embedding, filter=filter_and_params)}"
)
filter_or_params = {"or": [{"id": "a269f2bf-f4a2-43b9-aa8d-1cb2a2eb4691"}, {"id": "xxxxxxxx"}]}
print(f"==filter_or_params:{db.search_by_embedding(vector=embedding, filter=filter_or_params)}")
filter_like_params = {
"and": [
{"memory_type": {"like": "LongTermMemory"}},
]
}
print(
f"==filter_like_params:{db.search_by_embedding(vector=embedding, filter=filter_like_params)}"
)
"""
cypher_op_map = {"gt": ">", "lt": "<", "gte": ">=", "lte": "<="}
"""
filter_lt_params = {
"and": [
{"created_at": {"gt": "2025-11-29"}},
]
}
print(f"==filter_lt_params:{db.search_by_embedding(vector=embedding, filter=filter_lt_params)}")
def example_complex_shared_db_delete_memory(db):
print("delete node")
db.delete_node(id="582de45f-8f99-4006-8062-76eea5649d94")
print("delete edge")
db.delete_edge(source_id=1, target_id=2, type="PARENT", user_name="")
if __name__ == "__main__":
print("\n=== Example: Multi-DB ===")
example_multi_db(db_name="paper")
print("\n=== Example: Single-DB ===")
example_shared_db(db_name="shared-traval-group")
print("\n=== Example: Single-DB ===")
example_shared_db(db_name="shared-traval-group")
print("\n=== Example: Single-DB-Complex ===")
example_complex_shared_db(db_name="shared-traval-group-complex-new")
print("\n=== Example: Single-Community-DB-Complex ===")
example_complex_shared_db(db_name="paper", community=True)
print("\n=== Example: Single-DB-Complex searchFilter ===")
db = get_neo4j_graph(db_name="paper")
example_complex_shared_db_search_filter(db)
example_complex_shared_db_delete_memory(db)