-
Notifications
You must be signed in to change notification settings - Fork 0
/
loadgraph.go
258 lines (241 loc) · 7.67 KB
/
loadgraph.go
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
package neo4j
import (
"fmt"
"time"
"github.com/bserdar/slicemap"
"github.com/cloudprivacylabs/lpg/v2"
"github.com/cloudprivacylabs/lsa/pkg/ls"
"github.com/neo4j/neo4j-go-driver/v5/neo4j"
)
type DBGraph struct {
G *lpg.Graph
NodeIds map[*lpg.Node]string
Nodes map[string]*lpg.Node
EdgeIds map[*lpg.Edge]string
Edges map[string]*lpg.Edge
}
func NewDBGraph(g *lpg.Graph) *DBGraph {
return &DBGraph{
G: g,
NodeIds: make(map[*lpg.Node]string),
Nodes: make(map[string]*lpg.Node),
EdgeIds: make(map[*lpg.Edge]string),
Edges: make(map[string]*lpg.Edge),
}
}
func (dbg *DBGraph) NewNode(node *lpg.Node, dbID string) {
dbg.Nodes[dbID] = node
dbg.NodeIds[node] = dbID
}
func (dbg *DBGraph) NewEdge(edge *lpg.Edge, dbID string) {
dbg.Edges[dbID] = edge
dbg.EdgeIds[edge] = dbID
}
// LoadDBGraph loads a graph from the DB. The entity root nodes are
// matched based on the config entityMergeActions. If there is an
// entityMergeAction defined in the config for an entity, then this
// function will look up for a node that contains that entity name. If
// not, it will look for exact label match.
//
// For instance, if there is entityMergeAction defined for X, then a
// memory node :X:Y will be looked up as :X. If X does not have
// entityMergeAction, then a memory node :X:Y will look for :X:Y
func (s *Session) LoadDBGraph(ctx *ls.Context, tx neo4j.ExplicitTransaction, memGraph *lpg.Graph, config Config, cache *Neo4jCache) (*DBGraph, error) {
_, rootIds, _, err := s.CollectEntityDBIds(ctx, tx, config, memGraph, cache)
if err != nil {
return nil, err
}
fmt.Println("n root ids", len(rootIds))
g := ls.NewDocumentGraph()
dbg := NewDBGraph(g)
if len(rootIds) == 0 {
return dbg, nil
}
start := time.Now()
err = loadGraphByEntities(ctx, tx, s, dbg, rootIds, config, findNeighbors, func(n *lpg.Node) bool { return true })
if err != nil {
return nil, err
}
fmt.Println("Load by entities", time.Since(start))
return dbg, nil
}
func loadGraphByEntities(ctx *ls.Context, tx neo4j.ExplicitTransaction, session *Session, grph *DBGraph, rootIds []string, config Config, loadNeighbors func(*ls.Context, neo4j.ExplicitTransaction, *Session, Config, []string) ([]neo4jNode, []neo4jNode, []neo4jEdge, error), selectEntity func(*lpg.Node) bool) error {
if len(rootIds) == 0 {
return fmt.Errorf("Empty entity schema nodes")
}
// neo4j IDs
queue := make(map[string]struct{}, len(rootIds))
for _, id := range rootIds {
queue[id] = struct{}{}
}
for len(queue) > 0 {
q := make([]string, 0, len(queue))
for k := range queue {
q = append(q, k)
}
srcNodes, adjNodes, adjRelationships, err := loadNeighbors(ctx, tx, session, config, q)
if err != nil {
return err
}
if len(srcNodes) == 0 {
break
}
queue = make(map[string]struct{})
makeNode := func(srcNode neo4jNode) *lpg.Node {
src := grph.G.NewNode(srcNode.labels, nil)
labels := make([]string, 0, len(srcNode.labels))
for _, lbl := range srcNode.labels {
labels = append(labels, config.Expand(lbl))
}
ss := lpg.NewStringSet(labels...)
if (ss.Has(ls.AttributeTypeValue) || ss.Has(ls.AttributeTypeObject) || ss.Has(ls.AttributeTypeArray)) && !ss.Has(ls.AttributeNodeTerm) {
ss.Add(ls.DocumentNodeTerm)
}
src.SetLabels(ss)
// Set properties and node value
BuildNodePropertiesAfterLoad(src, srcNode.props, config)
nv := SetNodeValueAfterLoad(config, src, srcNode.props)
if nv != nil {
if err := ls.SetNodeValue(src, nv); err != nil {
panic(fmt.Errorf("Cannot set node value for %w %v", err, src))
}
}
grph.NewNode(src, srcNode.id)
return src
}
for _, srcNode := range srcNodes {
if _, seen := grph.Nodes[srcNode.id]; !seen {
makeNode(srcNode)
}
}
for _, node := range adjNodes {
if _, seen := grph.Nodes[node.id]; !seen {
nd := makeNode(node)
if selectEntity != nil && selectEntity(nd) {
queue[node.id] = struct{}{}
}
if _, ok := node.props[config.Shorten(ls.EntitySchemaTerm)]; !ok {
queue[node.id] = struct{}{}
}
}
}
for _, edge := range adjRelationships {
if _, seen := grph.Edges[edge.id]; !seen {
src := grph.Nodes[edge.startId]
target := grph.Nodes[edge.endId]
e := grph.G.NewEdge(src, target, config.Expand(edge.types), edge.props)
grph.NewEdge(e, edge.id)
}
}
}
return nil
}
func (s *Session) CollectEntityDBIds(ctx *ls.Context, tx neo4j.ExplicitTransaction, config Config, grph *lpg.Graph, cache *Neo4jCache) (entityRootNodes []*lpg.Node, entityRootDBIds []string, entityInfo map[*lpg.Node]ls.EntityInfo, err error) {
entityInfo = ls.GetEntityRootsByID(grph)
// Remove any empty IDs
for k, v := range entityInfo {
if len(v.GetID()) == 0 {
delete(entityInfo, k)
}
}
// Collect unique labels
labels := make(map[string][]*lpg.Node)
for node := range entityInfo {
// If one of the labels has entityMergeConfig, then use that label
// to load the node
labelSlice := node.GetLabels().Slice()
entityLabel := ""
for _, l := range labelSlice {
if config.IsMergeEntity(l) {
if entityLabel != "" {
return nil, nil, nil, fmt.Errorf("Node has both %s and %s, both of which are entity labels", entityLabel, l)
}
entityLabel = l
}
}
if entityLabel == "" {
l := config.MakeLabels(labelSlice)
labels[l] = append(labels[l], node)
} else {
l := config.MakeLabels([]string{entityLabel})
labels[l] = append(labels[l], node)
}
}
// Load entities by their unique labels
for label, rootNodes := range labels {
unwind := make([]interface{}, 0, len(rootNodes))
rootIds := slicemap.SliceMap[string, *lpg.Node]{}
for _, rootNode := range rootNodes {
id := entityInfo[rootNode].GetID()
rootIds.Put(id, rootNode)
if len(id) == 1 {
unwind = append(unwind, map[string]interface{}{"id": id[0]})
} else {
unwind = append(unwind, map[string]interface{}{"id": id})
}
}
entityIDTerm := config.Shorten(ls.EntityIDTerm)
query := fmt.Sprintf("unwind $ids as nodeId match (n%s) where n.`%s`=nodeId.id return n", label, entityIDTerm)
idrec, e := tx.Run(ctx, query, map[string]interface{}{"ids": unwind})
if e != nil {
err = e
return
}
nRecords := 0
for idrec.Next(ctx) {
nRecords++
record := idrec.Record()
dbNode, _ := record.Values[0].(neo4j.Node)
cache.putNodes(dbNode)
entityIDAny := dbNode.Props[entityIDTerm]
var entityRootNode *lpg.Node
var exists bool
if s, ok := entityIDAny.(string); ok {
entityRootNode, exists = rootIds.Get([]string{s})
} else if arr, ok := entityIDAny.([]interface{}); ok {
str := make([]string, 0, len(arr))
for i := range arr {
str[i] = arr[i].(string)
}
entityRootNode, exists = rootIds.Get(str)
}
if exists {
entityRootNodes = append(entityRootNodes, entityRootNode)
entityRootDBIds = append(entityRootDBIds, dbNode.ElementId)
} else {
panic(fmt.Sprintf("Unexpected node loaded: %+v", dbNode))
}
// // Find the matching node
// for _, rootNode := range rootNodes {
// id := entityInfo[rootNode].GetID()
// if len(id) == 1 {
// if s, ok := record.Values[1].(string); ok {
// if s == id[0] {
// entityRootNodes = append(entityRootNodes, rootNode)
// entityRootDBIds = append(entityRootDBIds, dbId)
// break
// }
// }
// } else {
// if arr, ok := record.Values[1].([]interface{}); ok {
// if len(arr) == len(id) {
// found := true
// for i := range arr {
// if arr[i] != id[i] {
// found = false
// break
// }
// }
// if found {
// entityRootNodes = append(entityRootNodes, rootNode)
// entityRootDBIds = append(entityRootDBIds, dbId)
// break
// }
// }
// }
// }
//}
}
}
return
}