|
| 1 | +/* |
| 2 | + * Copyright (C) 2017 Baidu, Inc. All Rights Reserved. |
| 3 | + */ |
| 4 | +package eu.socialsensor.graphdatabases; |
| 5 | + |
| 6 | +import java.io.File; |
| 7 | +import java.util.Iterator; |
| 8 | +import java.util.List; |
| 9 | +import java.util.Map; |
| 10 | +import java.util.Set; |
| 11 | + |
| 12 | +import com.baidu.hugegraph.driver.HugeClient; |
| 13 | +import com.baidu.hugegraph.driver.SchemaManager; |
| 14 | +import com.baidu.hugegraph.structure.graph.Edge; |
| 15 | +import com.baidu.hugegraph.structure.graph.Vertex; |
| 16 | +//import com.tinkerpop.blueprints.Edge; |
| 17 | +//import com.tinkerpop.blueprints.Vertex; |
| 18 | + |
| 19 | +import eu.socialsensor.insert.HugeGraphMassiveInsertion; |
| 20 | +import eu.socialsensor.main.BenchmarkConfiguration; |
| 21 | +import eu.socialsensor.main.GraphDatabaseType; |
| 22 | +import eu.socialsensor.utils.HugeGraphUtils; |
| 23 | + |
| 24 | +/** |
| 25 | + * Created by zhangsuochao on 17/6/21. |
| 26 | + */ |
| 27 | +public class HugeGraphDatabase extends GraphDatabaseBase<Iterator<Vertex>, Iterator<Edge>, Vertex, Edge> { |
| 28 | + |
| 29 | + protected final HugeClient hugeClient; |
| 30 | + |
| 31 | + public HugeGraphDatabase(BenchmarkConfiguration config, File dbStorageDirectoryIn) { |
| 32 | + super(GraphDatabaseType.HUGEGRAPH_CASSANDRA, dbStorageDirectoryIn); |
| 33 | + hugeClient = HugeClient.open("http://localhost:8080", |
| 34 | + "hugegraph"); |
| 35 | + } |
| 36 | + |
| 37 | + @Override |
| 38 | + public Vertex getOtherVertexFromEdge(Edge r, Vertex oneVertex) { |
| 39 | + return null; |
| 40 | + } |
| 41 | + |
| 42 | + @Override |
| 43 | + public Vertex getSrcVertexFromEdge(Edge edge) { |
| 44 | + return null; |
| 45 | + } |
| 46 | + |
| 47 | + @Override |
| 48 | + public Vertex getDestVertexFromEdge(Edge edge) { |
| 49 | + return null; |
| 50 | + } |
| 51 | + |
| 52 | + @Override |
| 53 | + public Vertex getVertex(Integer i) { |
| 54 | + return hugeClient.graph().getVertex(HugeGraphUtils.createId("node",i+"")); |
| 55 | + } |
| 56 | + |
| 57 | + @Override |
| 58 | + public Iterator<Edge> getAllEdges() { |
| 59 | + return hugeClient.graph().getEdges().iterator(); |
| 60 | + } |
| 61 | + |
| 62 | + @Override |
| 63 | + public Iterator<Edge> getNeighborsOfVertex(Vertex v) { |
| 64 | + return null; |
| 65 | + } |
| 66 | + |
| 67 | + @Override |
| 68 | + public boolean edgeIteratorHasNext(Iterator<Edge> it) { |
| 69 | + return false; |
| 70 | + } |
| 71 | + |
| 72 | + @Override |
| 73 | + public Edge nextEdge(Iterator<Edge> it) { |
| 74 | + return it.next(); |
| 75 | + } |
| 76 | + |
| 77 | + @Override |
| 78 | + public void cleanupEdgeIterator(Iterator<Edge> it) { |
| 79 | + |
| 80 | + } |
| 81 | + |
| 82 | + @Override |
| 83 | + public Iterator<Vertex> getVertexIterator() { |
| 84 | + return null; |
| 85 | + } |
| 86 | + |
| 87 | + @Override |
| 88 | + public boolean vertexIteratorHasNext(Iterator<Vertex> it) { |
| 89 | + return it.hasNext(); |
| 90 | + } |
| 91 | + |
| 92 | + @Override |
| 93 | + public Vertex nextVertex(Iterator<Vertex> it) { |
| 94 | + return it.next(); |
| 95 | + } |
| 96 | + |
| 97 | + @Override |
| 98 | + public void cleanupVertexIterator(Iterator<Vertex> it) { |
| 99 | + |
| 100 | + } |
| 101 | + |
| 102 | + @Override |
| 103 | + public void open() { |
| 104 | + |
| 105 | + } |
| 106 | + |
| 107 | + @Override |
| 108 | + public void createGraphForSingleLoad() { |
| 109 | + |
| 110 | + } |
| 111 | + |
| 112 | + @Override |
| 113 | + public void massiveModeLoading(File dataPath) { |
| 114 | + SchemaManager schemaManager = hugeClient.schema(); |
| 115 | + schemaManager.makePropertyKey("nodeId").asText().ifNotExist().create(); |
| 116 | + schemaManager.makeVertexLabel("node").properties("nodeId").primaryKeys("nodeId").ifNotExist().create(); |
| 117 | + schemaManager.makeEdgeLabel("link").link("node","node").ifNotExist().create(); |
| 118 | + HugeGraphMassiveInsertion massiveInsertion = new HugeGraphMassiveInsertion(this.hugeClient.graph()); |
| 119 | + massiveInsertion.createGraph(dataPath,0 /* scenarioNumber */); |
| 120 | + } |
| 121 | + |
| 122 | + @Override |
| 123 | + public void singleModeLoading(File dataPath, File resultsPath, int scenarioNumber) { |
| 124 | + |
| 125 | + } |
| 126 | + |
| 127 | + @Override |
| 128 | + public void createGraphForMassiveLoad() { |
| 129 | + |
| 130 | + } |
| 131 | + |
| 132 | + @Override |
| 133 | + public void shutdown() { |
| 134 | + |
| 135 | + } |
| 136 | + |
| 137 | + @Override |
| 138 | + public void delete() { |
| 139 | + |
| 140 | + } |
| 141 | + |
| 142 | + @Override |
| 143 | + public void shutdownMassiveGraph() { |
| 144 | + |
| 145 | + } |
| 146 | + |
| 147 | + @Override |
| 148 | + public void shortestPath(Vertex fromNode, Integer node) { |
| 149 | + |
| 150 | + } |
| 151 | + |
| 152 | + @Override |
| 153 | + public int getNodeCount() { |
| 154 | + return 0; |
| 155 | + } |
| 156 | + |
| 157 | + @Override |
| 158 | + public Set<Integer> getNeighborsIds(int nodeId) { |
| 159 | + return null; |
| 160 | + } |
| 161 | + |
| 162 | + @Override |
| 163 | + public double getNodeWeight(int nodeId) { |
| 164 | + return 0; |
| 165 | + } |
| 166 | + |
| 167 | + @Override |
| 168 | + public void initCommunityProperty() { |
| 169 | + |
| 170 | + } |
| 171 | + |
| 172 | + @Override |
| 173 | + public Set<Integer> getCommunitiesConnectedToNodeCommunities(int nodeCommunities) { |
| 174 | + return null; |
| 175 | + } |
| 176 | + |
| 177 | + @Override |
| 178 | + public Set<Integer> getNodesFromCommunity(int community) { |
| 179 | + return null; |
| 180 | + } |
| 181 | + |
| 182 | + @Override |
| 183 | + public Set<Integer> getNodesFromNodeCommunity(int nodeCommunity) { |
| 184 | + return null; |
| 185 | + } |
| 186 | + |
| 187 | + @Override |
| 188 | + public double getEdgesInsideCommunity(int nodeCommunity, int communityNodes) { |
| 189 | + return 0; |
| 190 | + } |
| 191 | + |
| 192 | + @Override |
| 193 | + public double getCommunityWeight(int community) { |
| 194 | + return 0; |
| 195 | + } |
| 196 | + |
| 197 | + @Override |
| 198 | + public double getNodeCommunityWeight(int nodeCommunity) { |
| 199 | + return 0; |
| 200 | + } |
| 201 | + |
| 202 | + @Override |
| 203 | + public void moveNode(int from, int to) { |
| 204 | + |
| 205 | + } |
| 206 | + |
| 207 | + @Override |
| 208 | + public double getGraphWeightSum() { |
| 209 | + return 0; |
| 210 | + } |
| 211 | + |
| 212 | + @Override |
| 213 | + public int reInitializeCommunities() { |
| 214 | + return 0; |
| 215 | + } |
| 216 | + |
| 217 | + @Override |
| 218 | + public int getCommunityFromNode(int nodeId) { |
| 219 | + return 0; |
| 220 | + } |
| 221 | + |
| 222 | + @Override |
| 223 | + public int getCommunity(int nodeCommunity) { |
| 224 | + return 0; |
| 225 | + } |
| 226 | + |
| 227 | + @Override |
| 228 | + public int getCommunitySize(int community) { |
| 229 | + return 0; |
| 230 | + } |
| 231 | + |
| 232 | + @Override |
| 233 | + public Map<Integer, List<Integer>> mapCommunities(int numberOfCommunities) { |
| 234 | + return null; |
| 235 | + } |
| 236 | + |
| 237 | + @Override |
| 238 | + public boolean nodeExists(int nodeId) { |
| 239 | + return false; |
| 240 | + } |
| 241 | +} |
0 commit comments