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
|
/*
* ============LICENSE_START=======================================================
* org.onap.aai
* ================================================================================
* Copyright © 2017-2018 AT&T Intellectual Property. All rights reserved.
* ================================================================================
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ============LICENSE_END=========================================================
*/
package org.onap.aai.dbgen;
import com.google.common.collect.Multimap;
import org.apache.tinkerpop.gremlin.structure.Vertex;
import org.janusgraph.core.Cardinality;
import org.janusgraph.core.Multiplicity;
import org.janusgraph.core.PropertyKey;
import org.janusgraph.core.schema.JanusGraphManagement;
import org.onap.aai.config.SpringContextAware;
import org.onap.aai.edges.EdgeIngestor;
import org.onap.aai.edges.EdgeRule;
import org.onap.aai.edges.exceptions.EdgeRuleNotFoundException;
import org.onap.aai.introspection.Introspector;
import org.onap.aai.introspection.LoaderUtil;
import org.onap.aai.logging.LogFormatTools;
import org.onap.aai.schema.enums.PropertyMetadata;
import org.onap.aai.util.AAIConfig;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Optional;
import java.util.Set;
import java.util.function.Function;
import java.util.stream.Collectors;
public class SchemaGenerator {
private static final Logger LOGGER = LoggerFactory.getLogger(SchemaGenerator.class);
private SchemaGenerator() {
}
/**
* Load schema into JanusGraph.
*
* @param graphMgmt
* the graph mgmt
*/
public static void loadSchemaIntoJanusGraph(final JanusGraphManagement graphMgmt, String backend) {
try {
AAIConfig.init();
} catch (Exception ex) {
LOGGER.error(" ERROR - Could not run AAIConfig.init(). {}", LogFormatTools.getStackTop(ex));
System.exit(1);
}
// NOTE - JanusGraph 0.5.3 doesn't keep a list of legal node Labels.
// They are only used when a vertex is actually being created.
// JanusGraph 1.1 will keep track (we think).
// Use EdgeRules to make sure edgeLabels are defined in the db. NOTE:
// the multiplicty used here is
// always "MULTI". This is not the same as our internal "Many2Many",
// "One2One", "One2Many" or "Many2One"
// We use the same edge-label for edges between many different types of
// nodes and our internal
// multiplicty definitions depends on which two types of nodes are being
// connected.
makeEdgeLabels(graphMgmt);
Map<String, Introspector> objs = LoaderUtil.getLatestVersion().getAllObjects();
Map<String, PropertyKey> seenProps = new HashMap<>();
for (Introspector obj : objs.values()) {
for (String propName : obj.getProperties()) {
String dbPropName = propName;
Optional<String> alias = obj.getPropertyMetadata(propName, PropertyMetadata.DB_ALIAS);
if (alias.isPresent()) {
dbPropName = alias.get();
}
if (graphMgmt.containsRelationType(dbPropName)) {
LOGGER.debug(" PropertyKey [{}] already existed in the DB. ", dbPropName);
} else {
Class<?> type = obj.getClass(propName);
Cardinality cardinality = Cardinality.SINGLE;
boolean process = false;
if (obj.isListType(propName) && obj.isSimpleGenericType(propName)) {
cardinality = Cardinality.SET;
type = obj.getGenericTypeClass(propName);
process = true;
} else if (obj.isSimpleType(propName)) {
process = true;
}
if (process) {
LOGGER.info("Creating PropertyKey: [{}], [{}], [{}]",
dbPropName, type.getSimpleName(), cardinality);
PropertyKey propK;
if (!seenProps.containsKey(dbPropName)) {
propK = graphMgmt.makePropertyKey(dbPropName).dataType(type).cardinality(cardinality)
.make();
seenProps.put(dbPropName, propK);
} else {
propK = seenProps.get(dbPropName);
}
if (graphMgmt.containsGraphIndex(dbPropName)) {
LOGGER.debug(" Index [{}] already existed in the DB. ", dbPropName);
} else {
if (obj.getIndexedProperties().contains(propName)) {
if (obj.getUniqueProperties().contains(propName)) {
LOGGER.info("Add Unique index for PropertyKey: [{}]", dbPropName);
graphMgmt.buildIndex(dbPropName, Vertex.class).addKey(propK).unique()
.buildCompositeIndex();
} else {
LOGGER.info("Add index for PropertyKey: [{}]", dbPropName);
graphMgmt.buildIndex(dbPropName, Vertex.class).addKey(propK).buildCompositeIndex();
}
} else {
LOGGER.info("No index added for PropertyKey: [{}]", dbPropName);
}
}
}
}
}
}
LOGGER.info("-- About to call graphMgmt commit");
if (backend != null) {
LOGGER.info("Successfully loaded the schema to {}", backend);
}
graphMgmt.commit();
}
private static void makeEdgeLabels(JanusGraphManagement graphMgmt) {
try {
EdgeIngestor edgeIngestor = SpringContextAware.getBean(EdgeIngestor.class);
Set<String> labels = Optional.ofNullable(edgeIngestor.getAllCurrentRules())
.map(collectValues(EdgeRule::getLabel))
.orElseGet(HashSet::new);
labels.forEach(label -> {
if (graphMgmt.containsRelationType(label)) {
LOGGER.debug(" EdgeLabel [{}] already existed. ", label);
} else {
LOGGER.debug("Making EdgeLabel: [{}]", label);
graphMgmt.makeEdgeLabel(label).multiplicity(Multiplicity.valueOf("MULTI")).make();
}
});
} catch (EdgeRuleNotFoundException e) {
LOGGER.error("Unable to find all rules {}", LogFormatTools.getStackTop(e));
}
}
/**
* Returns a function collecting all the values in a {@link com.google.common.collect.Multimap}
* given a mapping function
*
* @param f The mapper function
* @param <K> The type of key used by the provided {@link com.google.common.collect.Multimap}
* @param <V> The type of value used by the provided {@link com.google.common.collect.Multimap}
* @param <V0> The type which <V> is mapped to
*/
private static <K, V, V0> Function<Multimap<K, V>, Set<V0>> collectValues(Function<V, V0> f) {
return as -> as.values().stream().map(f).collect(Collectors.toSet());
}
}
|
