| Package | Description |
|---|---|
| oracle.pgx.api |
This package contains the main Java APIs.
|
| oracle.pgx.api.admin |
This package contains the administrative interfaces of PGX.
|
| oracle.pgx.api.executionenvironment |
This packages contains classes for session execution environments.
|
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph) |
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph, EdgeProperty<java.lang.Double> aa) |
PgxFuture<java.lang.Void> |
PgxCollection.addAllAsync(java.util.Collection<E> source)
Add vertices/edges to an existing vertex/edge collection
|
PgxFuture<java.lang.Void> |
ComponentCollection.addAllAsync(java.util.Collection<PgxVertex<ID>> source) |
PgxFuture<java.lang.Void> |
PgxCollection.addAllAsync(E[] elements)
Add vertices/edges to an existing vertex/edge collection
|
PgxFuture<java.lang.Void> |
ServerInstance.addPinnedGraphAsync(GraphConfig cfg)
Add a pinned graph (will not be unloaded by engine) to be shared between sessions
|
static <T> PgxFuture<java.lang.Void> |
PgxFuture.allOf(java.util.List<PgxFuture<T>> promises) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph, int k, VertexProperty<ID,java.lang.Double> bc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc, PgxVertex<ID>... seeds) |
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromInDegreeAsync()
Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName)
Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName, java.lang.String isLeftPropName, boolean inPlace)
Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromInDegreeAsync(java.lang.String newGraphName)
Create a bipartite version of this graph with all vertices of in-degree = 0 being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, VertexSet<?> vertexSet, java.lang.String newGraphName, java.lang.String isLeftPropName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<BipartiteGraph> |
PgxGraph.bipartiteSubGraphFromLeftSetAsync(VertexSet<?> vertexSet, java.lang.String newGraphName)
Create a bipartite version of this graph with the given vertex set being the left set.
|
PgxFuture<PgxGraph> |
GraphBuilderImpl.buildAsync() |
PgxFuture<PgxGraph> |
GraphBuilder.buildAsync()
Shortcut for
GraphBuilder.buildAsync(String) without a name |
PgxFuture<PgxGraph> |
GraphBuilderImpl.buildAsync(java.lang.String newGraphName) |
PgxFuture<PgxGraph> |
GraphBuilder.buildAsync(java.lang.String newGraphName)
Builds a new graph out of the changes in this graph builder
|
PgxFuture<T> |
PgxFuture.cancelOn(PgxFuture promise)
If given promise completes exceptionally because it was canceled,
cancel() gets called on this promise as well. |
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph) |
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph, VertexSet<ID> center) |
PgxFuture<java.lang.Void> |
PgxCollection.clearAsync()
Clear an existing vertex/edge collection
|
PgxFuture<java.lang.Void> |
ComponentCollection.clearAsync() |
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.cloneAsync()
Convenience method around
PgxCollection.cloneAsync(String) passing name as nullClone an existing vertex/edge collection. |
PgxFuture<VertexProperty<ID,V>> |
VertexProperty.cloneAsync()
Create a copy of this property.
Convenience method for VertexProperty.cloneAsync(String) passing newPropertyName as null |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync()
|
PgxFuture<EdgeProperty<V>> |
EdgeProperty.cloneAsync()
Create a copy of this property.
Convenience method for EdgeProperty.cloneAsync(String) passing newPropertyName as null |
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.lang.String newGraphName)
Creates a copy of this graph.
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.cloneAsync(java.lang.String newName)
Clone an existing vertex/edge collection.
|
PgxFuture<PgxCollection<PgxVertex<ID>,ID>> |
ComponentCollection.cloneAsync(java.lang.String newName) |
PgxFuture<VertexProperty<ID,V>> |
VertexProperty.cloneAsync(java.lang.String newPropertyName)
Creates a copy of this property.
|
PgxFuture<PgxGraph> |
PgxGraph.cloneAsync(java.lang.String newGraphName)
Convenience method of
PgxGraph.cloneAsync(Collection, Collection, String)Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALL |
PgxFuture<EdgeProperty<V>> |
EdgeProperty.cloneAsync(java.lang.String newPropertyName)
Creates a copy of this property.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> cc) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> cc) |
<E> PgxFuture<EdgeProperty<PgxVect<E>>> |
PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(java.util.List<EdgeProperty<E>> edgePropertyList)
Takes a list of scalar edge properties of same type and creates a new edge vector property by combining them.
|
<E> PgxFuture<EdgeProperty<PgxVect<E>>> |
PgxGraph.combineEdgePropertiesIntoVectorPropertyAsync(java.util.List<EdgeProperty<E>> edgePropertyList, java.lang.String name)
Takes a list of scalar edge properties of same type and creates a new edge vector property by combining them.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.combineVertexPropertiesIntoVectorPropertyAsync(java.util.List<VertexProperty<ID,V>> vertexPropertyList, java.lang.String name)
Takes a list of scalar vertex properties of same type and creates a new vertex vector property by combining them.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph, int maxIteration, VertexProperty<ID,java.lang.Long> partitionDistribution) |
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitionDistribution) |
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramAsync(java.io.InputStream code)
Deprecated.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramAsync(java.io.InputStream code, boolean overwrite)
Deprecated.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramAsync(java.lang.String path)
Deprecated.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramAsync(java.lang.String path, boolean overwrite)
Deprecated.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramCodeAsync(java.lang.String code)
Compiles a Green-Marl program for parallel execution with all optimizations enabled.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramCodeAsync(java.lang.String code, boolean overwrite)
Compiles a Green-Marl program for parallel execution with all optimizations enabled.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.compileProgramCodeAsync(java.lang.String code, boolean overwrite, boolean parallel, java.util.List<oracle.pgx.api.GmCompilerOptimization> disabledOptimizations, boolean verbose)
Compiles a Green-Marl program.
|
static <T> PgxFuture<T> |
PgxFuture.completedFuture(T arg) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph, Partition<ID> partition, long partitionIndex, Scalar<java.lang.Double> conductance) |
PgxFuture<java.lang.Boolean> |
PgxCollection.containsAsync(E element)
Returns
true if this collection contains the specified element. |
PgxFuture<java.lang.Boolean> |
ComponentCollection.containsAsync(PgxVertex<ID> element) |
PgxFuture<java.lang.Boolean> |
PgxMap.containsKeyAsync(K key)
Checks if the map contains key.
|
PgxFuture<java.lang.Long> |
Analyst.countTrianglesAsync(PgxGraph graph, boolean sortVerticesByDegree) |
<ID> PgxFuture<AllPaths<ID>> |
PgxGraph.createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> dist, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
AllPaths object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs). |
<ID> PgxFuture<Partition<ID>> |
PgxGraph.createComponentsAsync(VertexProperty<ID,java.lang.Long> components, long numComponents)
Creates a
Partition object holding a collection of vertex sets, each representing a component. |
<V> PgxFuture<EdgeProperty<V>> |
PgxGraph.createEdgePropertyAsync(PropertyType type)
Creates a session-bound edge property
|
<V> PgxFuture<EdgeProperty<V>> |
PgxGraph.createEdgePropertyAsync(PropertyType type, java.lang.String name)
Creates a session-bound edge property
|
PgxFuture<EdgeSequence> |
PgxGraph.createEdgeSequenceAsync()
Creates a new edge sequence.
|
PgxFuture<EdgeSequence> |
PgxGraph.createEdgeSequenceAsync(java.lang.String name)
Creates a new edge sequence.
|
PgxFuture<EdgeSet> |
PgxGraph.createEdgeSetAsync()
Creates a new edge set.
|
PgxFuture<EdgeSet> |
PgxGraph.createEdgeSetAsync(java.lang.String name)
Creates a new edge set.
|
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.createEdgeVectorPropertyAsync(PropertyType type, int dimension)
Creates a session-bound edge vector property
|
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.createEdgeVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name)
Creates a session-bound edge vector property
|
<K,V> PgxFuture<PgxMap<K,V>> |
PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType)
Creates a session-bound map
|
<K,V> PgxFuture<PgxMap<K,V>> |
PgxGraph.createMapAsync(PropertyType keyType, PropertyType valType, java.lang.String mapName)
Creates a session-bound map
|
<ID> PgxFuture<PgxPath<ID>> |
PgxGraph.createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)
Creates a
PgxPath object representing the shortest path from one source to one destination (shortest regarding the given edge costs). |
<ID> PgxFuture<PgxPath<ID>> |
PgxGraph.createPathAsync(VertexSequence<ID> nodeSequence, EdgeSequence edgeSequence)
Creates a
PgxPath object from a sequence of vertices and edges. |
<T> PgxFuture<Scalar<T>> |
PgxGraph.createScalarAsync(PropertyType type)
Creates a new Scalar.
|
<T> PgxFuture<Scalar<T>> |
PgxGraph.createScalarAsync(PropertyType type, java.lang.String newScalarName)
Create a session-bound scalar.
|
PgxFuture<PgxSession> |
ServerInstance.createSessionAsync(java.lang.String source)
Create a new session.
|
PgxFuture<PgxSession> |
ServerInstance.createSessionAsync(java.lang.String source, java.lang.Long idleTimeout, java.lang.Long taskTimeout, java.util.concurrent.TimeUnit unit)
Creates a new session.
|
<T> PgxFuture<Scalar<PgxVect<T>>> |
PgxGraph.createVectorScalarAsync(PropertyType type, int dimension)
Create a session-bound vector scalar.
|
<T> PgxFuture<Scalar<PgxVect<T>>> |
PgxGraph.createVectorScalarAsync(PropertyType type, int dimension, java.lang.String newScalarName)
Create a session-bound vector scalar.
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.createVertexPropertyAsync(PropertyType type)
Creates a session-bound vertex property
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.createVertexPropertyAsync(PropertyType type, java.lang.String name)
Creates a session-bound vertex property
|
<E> PgxFuture<VertexSequence<E>> |
PgxGraph.createVertexSequenceAsync()
Creates a new vertex sequence.
|
<E> PgxFuture<VertexSequence<E>> |
PgxGraph.createVertexSequenceAsync(java.lang.String name)
Creates a new vertex sequence.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.createVertexSetAsync()
Creates a new vertex set.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.createVertexSetAsync(java.lang.String name)
Creates a new vertex set.
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension)
Creates a session-bound vertex vector property
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.createVertexVectorPropertyAsync(PropertyType type, int dimension, java.lang.String name)
Creates a session-bound vertex vector property
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph, java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.degreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) |
PgxFuture<java.lang.Void> |
ServerInstance.demotePinnedGraphAsync(GraphConfig cfg)
Demote pinned graph.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphAsync(oracle.pgx.loaders.location.GraphLocation location)
Describes the graph contained in a given graph location
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFileAsync(java.lang.String path)
Describes the graph contained in the file at the given path.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFileAsync(java.lang.String path, Format format)
Describes the graph contained in the file at the given path.
|
PgxFuture<java.lang.Void> |
Destroyable.destroyAsync()
Requests destruction of this object.
|
PgxFuture<java.lang.Void> |
Partition.destroyAsync(boolean ignoreNotFound) |
PgxFuture<java.lang.Void> |
ComponentCollection.destroyAsync(boolean ignoreNotFound) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph, Scalar<java.lang.Integer> diameter, VertexProperty<ID,java.lang.Integer> eccentricity) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, int max, double maxDiff, boolean useL2Norm, boolean useInEdge, VertexProperty<ID,java.lang.Double> ec) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> ec) |
PgxFuture<MapIterable<K,V>> |
PgxMap.entriesAsync()
Gets an entry set.
|
static <T> PgxFuture<T> |
PgxFuture.exceptionallyCompletedFuture(java.lang.Throwable throwable) |
PgxFuture<PgqlResultSet> |
PgxPreparedStatement.executeQueryAsync()
Executes the PGQL query in this
PgxPreparedStatement object and returns the PgqlResultSet object generated by the query. |
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>> |
VertexProperty.expandAsync()
If this is a vector property, expands this property into a list of scalar properties of same type.
|
<S> PgxFuture<java.util.List<EdgeProperty<S>>> |
EdgeProperty.expandAsync()
If this is a vector property, expands this property into a list of scalar properties of same type.
|
<S> PgxFuture<java.util.List<VertexProperty<ID,S>>> |
VertexProperty.expandAsync(java.lang.String namePrefix)
If this is a vector property, expands this property into a list of scalar properties of same type.
|
<S> PgxFuture<java.util.List<EdgeProperty<S>>> |
EdgeProperty.expandAsync(java.lang.String namePrefix)
If this is a vector property, expands this property into a list of scalar properties of same type.
|
<V extends java.lang.Comparable<V>> |
VertexSet.extractTopKFromMapAsync(PgxMap<PgxVertex<ID>,V> map, int k)
Extracts the top k keys from the given map and puts them into this collection.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<java.lang.Double> capacity, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
PgxFuture<java.lang.Void> |
Property.fillAsync(V value)
Fill this property with a given value.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, GraphFilter graphFilter, java.lang.String newGraphName)
Create a subgraph of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(GraphFilter graphFilter)
Create a subgraph of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.filterAsync(GraphFilter graphFilter, java.lang.String newGraphName)
Create a subgraph of this graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph, PgxVertex<ID> root, VertexFilter filter, VertexFilter navigator, boolean initWithInf, VertexProperty<ID,java.lang.Integer> distance, VertexProperty<ID,PgxVertex<ID>> parent) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph, PgxVertex<ID> src) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph, PgxVertex<ID> src, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph, VertexSequence<ID> nodeSeq, EdgeSequence edgeSeq) |
PgxFuture<V> |
Scalar.getAsync() |
PgxFuture<V> |
Property.getAsync(ID id)
Gets the property value.
|
PgxFuture<V> |
PgxMap.getAsync(K key)
Gets the value of a key.
|
PgxFuture<V> |
Property.getAsync(K key)
Gets the property value.
|
PgxFuture<java.util.Set<java.lang.String>> |
PgxSession.getAvailableCompiledProgramIdsAsync()
Gets the set of available compiled program IDs.
|
PgxFuture<java.util.Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(GraphConfig config)
Gets a list of available in-memory snapshots of a graph described by a graph configuration.
|
PgxFuture<java.util.Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(PgxGraph snapshot)
Gets a list of available in-memory snapshots of a given snapshot.
|
PgxFuture<EntryIterable<ID,K,V>> |
Property.getBottomKValuesAsync(int k)
Gets the bottom k vertex/edge value pairs according to their value.
|
PgxFuture<java.util.Map<java.lang.String,PgxCollection<? extends PgxEntity<?>,?>>> |
PgxGraph.getCollectionsAsync()
Retrieves all currently allocated collections associated with the graph.
|
PgxFuture<oracle.pgx.api.CompiledProgram> |
PgxSession.getCompiledProgramAsync(java.lang.String id)
Gets a compiled program by ID.
|
PgxFuture<java.lang.Long> |
PgxVertex.getDegreeAsync()
Returns the degree of this vertex by calling
PgxVertex.getOutDegreeAsync(). |
<ID> PgxFuture<PgxVertex<ID>> |
PgxEdge.getDestinationAsync()
Gets the destination vertex.
|
PgxFuture<PgxEdge> |
PgxGraph.getEdgeAsync(long id)
Looks up a
PgxEdge of this graph by ID. |
PgxFuture<EdgeLabel> |
PgxGraph.getEdgeLabelAsync()
Get the edge labels belonging to this graph.
|
PgxFuture<java.util.Set<EdgeProperty<?>>> |
PgxGraph.getEdgePropertiesAsync()
Get the set of edge properties belonging to this graph.
|
<V> PgxFuture<EdgeProperty<V>> |
PgxGraph.getEdgePropertyAsync(java.lang.String name)
Gets an edge property of this graph
|
PgxFuture<EdgeSet> |
PgxGraph.getEdgesAsync()
Creates a new edge set containing all edges.
|
<E> PgxFuture<EdgeSet> |
PgxGraph.getEdgesAsync(EdgeFilter filter)
Creates a new edge set containing edges according to the given filter expression.
|
PgxFuture<VertexProperty<ID,java.lang.Double>> |
MatrixFactorizationModel.getEstimatedRatingsAsync(PgxVertex<ID> estimateRatingsFor)
Computes estimated ratings for a specific vertex.
|
PgxFuture<PgxGraph> |
PgxSession.getGraphAsync(java.lang.String name)
Gets an already loaded graph by its name.
|
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
ServerInstance.getGraphInfoAsync(java.lang.String graphName)
Get details of a (shared) persistent graph
|
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
ServerInstance.getGraphInfoAsync(java.lang.String sessionId, java.lang.String graphName)
Get details of a session-bound, private graph
|
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.GraphInfo>> |
ServerInstance.getGraphInfosAsync()
Get a list of currently active graphs.
|
PgxFuture<java.util.Map<java.lang.String,PgxGraph>> |
PgxSession.getGraphsAsync()
Returns a collection of graphs loaded in this session.
|
PgxFuture<java.lang.Long> |
PgxVertex.getInDegreeAsync()
Returns the inDegree of this vertex, i.e., the number of incoming edges of this vertex.
|
PgxFuture<java.util.Collection<PgxEdge>> |
PgxVertex.getInEdgesAsync()
Returns all incoming edges of this vertex.
|
PgxFuture<java.util.Collection<PgxVertex<ID>>> |
PgxVertex.getInNeighborsAsync()
Returns all incoming neighbors of this vertex, i.e., all vertices that have an edge to this vertex.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>> |
BipartiteGraph.getIsLeftPropertyAsync()
Gets the 'is Left' vertex property of the graph.
|
PgxFuture<java.lang.String> |
PgxEdge.getLabelAsync()
Gets the label.
|
PgxFuture<java.util.Set<java.lang.String>> |
PgxVertex.getLabelsAsync()
Gets the labels
|
PgxFuture<oracle.pgx.common.pojo.admin.MemoryInfo> |
ServerInstance.getMemoryInfoAsync()
Gets the memory info.
|
PgxFuture<java.util.Collection<PgxVertex<ID>>> |
PgxVertex.getNeighborsAsync(Direction direction, boolean removeDuplicates)
Returns all neighbors of this vertex, i.e., all vertices that are connected to this vertex.
|
PgxFuture<java.lang.Long> |
PgxVertex.getOutDegreeAsync()
Returns the outDegree of this vertex, i.e., the number of outgoing edges of this vertex.
|
PgxFuture<java.util.Collection<PgxEdge>> |
PgxVertex.getOutEdgesAsync()
Returns all outgoing edges of this vertex.
|
PgxFuture<java.util.Collection<PgxVertex<ID>>> |
PgxVertex.getOutNeighborsAsync()
Returns all outgoing neighbors of this vertex, i.e., all nodes this vertex has an edge to.
|
PgxFuture<PgqlResultSet> |
PgxSession.getPgqlResultSetAsync(java.lang.String id)
Gets a PGQL result set by ID.
|
PgxFuture<java.util.Map<PgxConfig.Field,java.lang.Object>> |
ServerInstance.getPgxConfigAsync()
Gets the PGX config.
|
PgxFuture<PgxConfig> |
ServerInstance.getPgxConfigObjectAsync()
Gets the PGX config.
|
PgxFuture<java.lang.String> |
ServerInstance.getPgxVersionAsync()
Gets the PGX version of this instance.
|
<V> PgxFuture<V> |
PgxEntity.getPropertyAsync(java.lang.String propertyName)
Gets the value of a property.
|
PgxFuture<PgxEdge> |
PgxGraph.getRandomEdgeAsync()
Picks a random edge in the graph.
|
<ID> PgxFuture<PgxVertex<ID>> |
PgxGraph.getRandomVertexAsync()
Picks a random vertex in the graph.
|
PgxFuture<PgxSession> |
ServerInstance.getSessionAsync(java.lang.String id)
Gets a session by ID.
|
PgxFuture<oracle.pgx.common.pojo.admin.SessionInfo> |
ServerInstance.getSessionInfoAsync(java.lang.String sessionId)
Gets the session info.
|
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.SessionInfo>> |
ServerInstance.getSessionInfosAsync()
Gets the session infos.
|
<ID> PgxFuture<PgxVertex<ID>> |
PgxEdge.getSourceAsync()
Gets the source vertex.
|
PgxFuture<oracle.pgx.common.pojo.admin.PoolInfo> |
ServerInstance.getThreadPoolInfoAsync(PoolType type)
Gets the thread pool info.
|
PgxFuture<EntryIterable<ID,K,V>> |
Property.getTopKValuesAsync(int k)
Gets the top k vertex/edge value pairs according to their value.
|
PgxFuture<EntryIterable<ID,K,V>> |
Property.getValuesAsync()
Gets the values.
|
<ID> PgxFuture<PgxVertex<ID>> |
PgxGraph.getVertexAsync(ID id)
Looks up a
PgxVertex of this graph by ID. |
<ID> PgxFuture<VertexLabels<ID>> |
PgxGraph.getVertexLabelsAsync()
Get the vertex labels belonging to this graph.
|
PgxFuture<java.util.Set<VertexProperty<?,?>>> |
PgxGraph.getVertexPropertiesAsync()
Get the set of vertex properties belonging to this graph.
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.getVertexPropertyAsync(java.lang.String name)
Gets a vertex property of this graph
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.getVerticesAsync()
Creates a new vertex set containing all vertices.
|
<ID> PgxFuture<Pair<PgxVertex<ID>,PgxVertex<ID>>> |
PgxEdge.getVerticesAsync()
Gets both vertices of this edge as a pair.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.getVerticesAsync(VertexFilter filter)
Creates a new vertex set containing vertices according to the given filter expression.
|
<E> PgxFuture<VertexSet<E>> |
PgxGraph.getVerticesAsync(VertexFilter filter, java.lang.String name)
Creates a new vertex set containing vertices according to the given filter expression.
|
PgxFuture<java.lang.Boolean> |
PgxGraph.hasEdgeAsync(long id)
Looks up whether the graph has an Edge with the given ID
|
PgxFuture<java.lang.Boolean> |
PgxGraph.hasEdgeLabelAsync() |
<ID> PgxFuture<java.lang.Boolean> |
PgxGraph.hasVertexAsync(ID id)
Looks up whether the graph has a Vertex with the given ID
|
PgxFuture<java.lang.Boolean> |
PgxGraph.hasVertexLabelsAsync() |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, int max, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs) |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> auth, VertexProperty<ID,java.lang.Double> hubs) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) |
<ID> PgxFuture<java.lang.Boolean> |
PgxGraph.isBipartiteGraphAsync(VertexProperty<ID,java.lang.Boolean> isLeft)
Checks whether a given graph is a bipartite graph.
|
PgxFuture<java.lang.Boolean> |
ServerInstance.isEngineRunningAsync()
Check if the engine is currently up
|
PgxFuture<java.lang.Boolean> |
PgxGraph.isFreshAsync()
Check whether an in-memory representation of a graph is fresh.
|
PgxFuture<java.lang.Boolean> |
PgxCollection.isMutableAsync()
Checks whether an existing vertex/edge collection is mutable
|
PgxFuture<java.lang.Boolean> |
ComponentCollection.isMutableAsync() |
PgxFuture<java.util.Iterator<E>> |
PgxCollection.iteratorAsync()
Gets an Iterator over the collection.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, int minCore, int maxCore, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore) |
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph, Scalar<java.lang.Long> maxKCore, VertexProperty<ID,java.lang.Long> kcore) |
PgxFuture<java.lang.Iterable<K>> |
PgxMap.keysAsync() |
PgxFuture<java.lang.Void> |
ServerInstance.killSessionAsync(java.lang.String sessionId)
Kill a session.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> lcc) |
PgxFuture<GraphConfig> |
ServerInstance.lookupPreloadedGraphAsync(java.lang.String name)
Looks up the config of a pre-loaded graph by name.
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, double learningRate, double changePerStep, double lambda, int maxStep, int vectorLength, VertexProperty<ID,PgxVect<java.lang.Double>> features) |
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,PgxVect<java.lang.Double>> features) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph, java.lang.String propertyName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Integer> dc) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph) |
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph, PgxMap<java.lang.Integer,java.lang.Long> distribution) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, boolean norm, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition) |
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> avgConductance, Scalar<java.lang.Double> minConductance) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition, Scalar<java.lang.Double> modularity) |
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph, Partition<ID> partition, java.lang.String modularityName) |
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph) |
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph, VertexSet<ID> periphery) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, PgxVertex<ID> v, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, double d, int maxIter, double maxDiff, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph, VertexSet<ID> vertices, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph, VertexSet<ID> vertices, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<PgxVertex<ID>> |
PgxGraph.pickRandomVertexAsync()
Deprecated.
since 2.5.0, see
PgxGraph.getRandomVertexAsync() |
PgxFuture<PgxPreparedStatement> |
PgxGraph.preparePgqlAsync(java.lang.String pgqlString)
Prepares a pattern matching query.
|
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) |
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, EdgeProperty<java.lang.Boolean> mst) |
PgxFuture<PgqlResultSet> |
PgxGraph.queryPgqlAsync(java.lang.String pgqlString)
Submits a pattern matching query.
|
PgxFuture<PgqlResultSet> |
PgxGraph.queryPgqlAsync(java.lang.String pgqlString, oracle.pgx.config.PatternMatchingSemantic patternMatchingSemantic)
Deprecated.
since 2.5.0, use
PgxGraph.queryPgqlAsync(String) and PGQL function all_different(v1, v2, ...) to find patterns that are isomorphic |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph) |
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.radiusAsync(PgxGraph graph, Scalar<java.lang.Integer> radius, VertexProperty<ID,java.lang.Integer> eccentricity) |
<ID> PgxFuture<java.lang.Integer> |
Analyst.reachabilityAsync(PgxGraph graph, PgxVertex<ID> source, PgxVertex<ID> dest, int maxHops, boolean ignoreEdgeDirection) |
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config, GraphMetaData metaData)
Reads a graph and its properties of a specific version (metaData) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config, GraphMetaData metaData, java.lang.String newGraphName)
Reads a graph and its properties of a specific version (metaData) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config, long creationTimestamp)
Reads a graph and its properties of a specific version (creationTimestamp) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphAsOfAsync(GraphConfig config, long creationTimestamp, java.lang.String newGraphName)
Reads a graph and its properties of a specific version (creationTimestamp) into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path)
Loads the graph contained in the file at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path, Format format)
Loads the graph contained in the file at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path, Format format, java.lang.String newGraphName)
Loads the graph contained in the files at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFileAsync(java.lang.String path, java.lang.String newGraphName)
Loads the graph contained in the file at the given path.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths, Format format, java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean updateIfNotFresh)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, boolean updateIfNotFresh, java.lang.String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, long maxAge, java.util.concurrent.TimeUnit maxAgeTimeUnit, boolean blockIfFull, java.lang.String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config, java.lang.String newGraphName)
Reads a graph and its properties, specified a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(java.lang.String path)
Reads a graph and its properties, specified by a path to a graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(java.lang.String path, java.lang.String newGraphName)
Reads a graph and its properties, specified by a path to a graph config, into memory.
|
PgxFuture<java.lang.Void> |
PgxCollection.removeAllAsync(java.util.Collection<E> source)
Remove vertices/edges from an existing vertex/edge collection
|
PgxFuture<java.lang.Void> |
ComponentCollection.removeAllAsync(java.util.Collection<PgxVertex<ID>> source) |
PgxFuture<java.lang.Boolean> |
PgxMap.removeAsync(K key)
Removes the entry specified by the given key from the map with the given name.
|
PgxFuture<java.lang.Void> |
Property.renameAsync(java.lang.String newPropertyName)
Renames this property.
|
PgxFuture<java.lang.Void> |
ServerInstance.resizePoolAsync(PoolType poolType, int parallelism)
Resize a pool to use a different degree of parallelism
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, double maxDiff, int maxIter, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.salsaAsync(BipartiteGraph graph, int k)
Convenience method around
Analyst.salsaAsync(BipartiteGraph, int, double, double, int) using
maxDiff = 0.01 d = 0.85 maxIter = 1000 |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.salsaAsync(BipartiteGraph graph, int k, double maxDiff, double d, int maxIter)
SALSA recommendation algorithm.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph, VertexProperty<ID,java.lang.Double> salsaRank) |
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) |
PgxFuture<java.lang.Void> |
PgxMap.setAsync(K key, V value)
Sets the value for a key in the map specified by the given name.
|
PgxFuture<java.lang.Void> |
Property.setAsync(K key, V value)
Sets a property value.
|
PgxFuture<java.lang.Void> |
Scalar.setAsync(V value)
Sets the scalar value.
|
<V> PgxFuture<java.lang.Void> |
PgxEntity.setPropertyAsync(java.lang.String propertyName, V value)
Sets the value of a property.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, GraphMetaData metaData)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, GraphMetaData metaData, boolean forceDeleteTransientProperties)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, long creationTimestamp)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
PgxSession.setSnapshotAsync(PgxGraph graph, long creationTimestamp, boolean forceDeleteTransientProperties)
Sets a graph to a specific snapshot.
|
PgxFuture<java.lang.Void> |
Property.setValuesAsync(java.util.Map<K,V> values)
Sets multiple property values.
|
PgxFuture<java.lang.Void> |
Property.setValuesAsync(java.util.Map<K,V> values, V defaultValue)
Sets multiple property values.
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, java.lang.String parentName, java.lang.String parentEdgeName) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, java.lang.String parentName, java.lang.String parentEdgeName) |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<java.lang.Double> cost, GraphFilter filterExpr, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src) |
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src, VertexProperty<ID,java.lang.Double> distance, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge) |
PgxFuture<java.lang.Boolean> |
ServerInstance.shutdownEngineAsync(long timeout, java.util.concurrent.TimeUnit unit)
Gracefully shuts down the engine and cleans up resources.
|
PgxFuture<java.lang.Void> |
ServerInstance.shutdownEngineNowAsync()
Forces the engine to stop and clean up resources.
|
PgxFuture<java.lang.Void> |
ServerInstance.shutdownEngineNowIfRunningAsync()
If the engine is currently up forces it to stop and clean up resources.
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync()
Convenience method around
PgxGraph.simplifyAsync(String) passing null as graphName |
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName)
Create a simplified version of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(oracle.pgx.common.mutations.MutationStrategy mutationStrategy) |
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.TrivialVertices trivialVertices, PgxGraph.Mode mode, java.lang.String newGraphName)
Convenience method for
PgxGraph.simplifyAsync(Collection, Collection, MultiEdges, SelfEdges, TrivialVertices, Mode, String)Passing Collection(vertexProperties) as VertexProperty.ALL Collection(edgeProperties) as EdgeProperty.ALLCreate a simplified version of a graph. |
PgxFuture<PgxGraph> |
PgxGraph.simplifyAsync(java.lang.String newGraphName)
Convenience method for
PgxGraph.simplifyAsync(MultiEdges, SelfEdges, TrivialVertices, Mode, String)Passing StrategyType as StrategyType.REMOVE_MULTI_EDGES SelfEdges as SelfEdges.REMOVE_SELF_EDGES Trivial Vertices as TrivialVertices.REMOVE_TRIVIAL_VERTICES Mode as Mode.CREATE_COPYCreate a simplified version of a graph. |
PgxFuture<java.lang.Integer> |
PgxMap.sizeAsync()
Returns the size of the map
|
PgxFuture<java.lang.Integer> |
PgxCollection.sizeAsync()
Gets the number of elements in this collection
|
PgxFuture<java.lang.Long> |
Property.sizeAsync()
Gets the size/length of this property.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync()
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(PgxGraph.SortOrder sortOrder, PgxGraph.Degree degree, PgxGraph.Mode mode, java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sortByDegreeAsync(java.lang.String newGraphName)
Create a sorted version of a graph and all its properties.
|
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, double e, java.lang.String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
|
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(double e)
Sparsifies the given graph and returns a new graph with less edges.
Convenience method around |
PgxFuture<PgxGraph> |
PgxGraph.sparsifyAsync(double e, java.lang.String newGraphName)
Sparsifies the given graph and returns a new graph with less edges.
Convenience method around |
PgxFuture<java.lang.Void> |
ServerInstance.startEngineAsync()
Starts the PGX engine.
|
PgxFuture<java.lang.Void> |
ServerInstance.startEngineAsync(java.io.InputStream config)
Starts the PGX engine with a custom configuration.
|
PgxFuture<java.lang.Void> |
ServerInstance.startEngineAsync(java.util.Map<PgxConfig.Field,java.lang.Object> config)
Starts the PGX engine with a custom configuration.
|
PgxFuture<java.lang.Void> |
ServerInstance.startEngineAsync(PgxConfig config)
Starts the PGX engine with a custom configuration.
|
PgxFuture<java.lang.Void> |
ServerInstance.startEngineAsync(java.lang.String path)
Starts the PGX engine with a custom configuration given as path.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath)
Stores this graph in a given file format on a file system.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath, boolean overwrite)
Stores this graph in a given file format on a file system.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat, java.lang.String targetPath, java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, boolean overwrite)
Stores this graph in a given file format on a file system.
|
PgxFuture<GraphConfig> |
PgxGraph.storeAsync(GraphConfig targetConfig, boolean overwrite)
Stores this graph in a file or database.
|
PgxFuture<java.lang.Void> |
PgxFuture.thenAccept(java.util.function.Consumer<? super T> block) |
<U> PgxFuture<U> |
PgxFuture.thenApply(java.util.function.Function<? super T,? extends U> function) |
<U> PgxFuture<U> |
PgxFuture.thenApplyAsync(java.util.function.Function<? super T,? extends U> function, java.util.concurrent.Executor executor) |
<U,V> PgxFuture<V> |
PgxFuture.thenCombine(java.util.concurrent.CompletableFuture<? extends U> other, java.util.function.BiFunction<? super T,? super U,? extends V> function) |
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise)
completes the given promise whenever this completes.
|
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise, java.lang.Runnable cleanup)
completes the given promise whenever this completes.
|
<U> PgxFuture<U> |
PgxFuture.thenCompose(java.util.function.Function<? super T,? extends java.util.concurrent.CompletionStage<U>> function) |
<U> PgxFuture<U> |
PgxFuture.thenReturn(U result)
A future that discards its result and returns the given parameter on completion.
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.toMutableAsync()
Create a mutable copy of an existing vertex/edge collection
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.toMutableAsync(java.lang.String newName)
Create a mutable copy of an existing vertex/edge collection
|
PgxFuture<PgxCollection<PgxVertex<ID>,ID>> |
ComponentCollection.toMutableAsync(java.lang.String newName) |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync()
Convenience method around
PgxGraph.transposeAsync(String) passing null as graphName |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, java.util.Map<java.lang.String,java.lang.String> edgeLabelMapping, PgxGraph.Mode mode, java.lang.String newGraphName)
Creates a transpose of this graph.
|
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(PgxGraph.Mode mode)
Convenience method around
PgxGraph.transposeAsync(Mode, String) passing null as graphName |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(PgxGraph.Mode mode, java.lang.String newGraphName)
Convenience method around
PgxGraph.transposeAsync(Collection, Collection, Map, Mode, String)Passing Collection(vertexProps) as |
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync(java.lang.String newGraphName)
|
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync()
Convenience method around
PgxGraph.undirectAsync(String) passing null as graphName |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(java.util.Collection<VertexProperty<?,?>> vertexProps, java.util.Collection<EdgeProperty<?>> edgeProps, PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.Mode mode, java.lang.String newGraphName)
Convenience method to create for
PgxGraph.undirectAsync(MutationStrategy). |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(oracle.pgx.common.mutations.MutationStrategy mutationStrategy)
Create an undirected version of a graph.
|
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(PgxGraph.MultiEdges multiEdges, PgxGraph.SelfEdges selfEdges, PgxGraph.Mode mode, java.lang.String newGraphName)
Convenience method for
PgxGraph.undirectAsync(Collection, Collection, MultiEdges, SelfEdges, Mode, String)Passing Collection(vertexProps) as |
PgxFuture<PgxGraph> |
PgxGraph.undirectAsync(java.lang.String newGraphName)
Convenience method around
PgxGraph.undirectAsync(MultiEdges, SelfEdges, Mode, String)Passing StrategyType as |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph, VertexProperty<ID,java.lang.Double> bc) |
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph) |
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph, java.lang.String partitonDistributionName) |
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph, VertexProperty<ID,java.lang.Long> partitonDistribution) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, boolean norm, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, double e, double d, int max, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph, EdgeProperty<java.lang.Double> weight, VertexProperty<ID,java.lang.Double> rank) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, int maxIter, double tol, double dampingFactor, int salsaMaxIter, double salsaTol, VertexSequence<ID> hubs, VertexSequence<ID> authorities) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, int sizeCircleOfTrust, VertexSequence<ID> hubs, VertexSequence<ID> authorities) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int topK, VertexSequence<ID> hubs, VertexSequence<ID> authorities) |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, VertexSequence<ID> hubs, VertexSequence<ID> authorities) |
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<T> |
PgxFuture.cancelOn(PgxFuture promise)
If given promise completes exceptionally because it was canceled,
cancel() gets called on this promise as well. |
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise)
completes the given promise whenever this completes.
|
PgxFuture<T> |
PgxFuture.thenComplete(PgxFuture<T> promise, java.lang.Runnable cleanup)
completes the given promise whenever this completes.
|
| Modifier and Type | Method and Description |
|---|---|
static <T> PgxFuture<java.lang.Void> |
PgxFuture.allOf(java.util.List<PgxFuture<T>> promises) |
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<java.lang.Void> |
Control.addPinnedGraph(GraphConfig cfg)
Add a pinned graph (will not be unloaded by engine) to be shared between sessions
|
PgxFuture<java.lang.Void> |
Control.demotePinnedGraph(GraphConfig cfg)
Demote pinned graph.
|
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
Control.getGraphInfo(java.lang.String graphName)
Get details of a (shared) persistent graph
|
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
Control.getGraphInfo(java.lang.String sessionId, java.lang.String graphName)
Get details of a session-bound, private graph
|
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.GraphInfo>> |
Control.getGraphInfos()
Get a list of currently active graphs.
|
PgxFuture<oracle.pgx.common.pojo.admin.MemoryInfo> |
Control.getMemoryInfo()
Gets the memory info.
|
PgxFuture<java.util.Map<PgxConfig.Field,java.lang.Object>> |
Control.getPgxConfig()
Gets the pgx config.
|
default PgxFuture<PgxConfig> |
Control.getPgxConfigObject()
Gets the pgx config as
PgxConfig object |
PgxFuture<oracle.pgx.common.pojo.admin.SessionInfo> |
Control.getSessionInfo(java.lang.String sessionId)
Gets the session info.
|
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.SessionInfo>> |
Control.getSessionInfos()
Gets the session infos.
|
PgxFuture<oracle.pgx.common.pojo.admin.PoolInfo> |
Control.getThreadPoolInfo(PoolType type)
Gets the thread pool info.
|
PgxFuture<java.lang.String> |
Control.getVersion() |
PgxFuture<java.lang.Boolean> |
Control.isRunning()
Check if the engine is currently up
|
PgxFuture<java.lang.Void> |
Control.killSession(java.lang.String sessionId)
Kill session.
|
PgxFuture<GraphConfig> |
Control.lookupPreloadedGraph(java.lang.String name)
look up the config of a pre-loaded graph by name.
|
PgxFuture<java.lang.Void> |
Control.resizePool(PoolType poolType, int parallelism)
resize a pool to use a different degree of parallelism
|
PgxFuture<java.lang.Boolean> |
Control.shutdown(long timeout, java.util.concurrent.TimeUnit unit)
gracefully shuts down the engine and cleans up resources.
|
PgxFuture<java.lang.Void> |
Control.shutdownNow()
forces the engine to stop and clean up resources.
|
PgxFuture<java.lang.Void> |
Control.shutdownNowIfRunning() |
PgxFuture<java.lang.Void> |
Control.start() |
PgxFuture<java.lang.Void> |
Control.start(java.io.InputStream config) |
PgxFuture<java.lang.Void> |
Control.start(java.util.Map<PgxConfig.Field,java.lang.Object> config) |
default PgxFuture<java.lang.Void> |
Control.start(PgxConfig config) |
PgxFuture<java.lang.Void> |
Control.start(java.lang.String json) |
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<java.lang.Integer> |
CpuEnvironment.getMaxNumThreadsAsync() |
PgxFuture<java.lang.Integer> |
IoEnvironment.getNumThreadsPerTaskAsync() |
PgxFuture<TaskPriority> |
CpuEnvironment.getPriorityAsync() |
PgxFuture<java.util.List<java.util.Map.Entry<java.lang.String,java.lang.Object>>> |
ExecutionEnvironment.getValuesAsync() |
PgxFuture<java.lang.Integer> |
CpuEnvironment.getWeightAsync() |
PgxFuture<java.lang.Void> |
ExecutionEnvironment.resetAsync()
Resets the environment for this session to the configured default values.
|
PgxFuture<java.lang.Void> |
CpuEnvironment.setMaxNumThreadsAsync(java.lang.Integer maxNumThreads)
Sets the limit on the numbers of thread to use to the given value
|
PgxFuture<java.lang.Void> |
IoEnvironment.setNumThreadsPerTaskAsync(java.lang.Integer numThreadsPerTask)
Sets the current value for the number of threads used for IO tasks
|
PgxFuture<java.lang.Void> |
CpuEnvironment.setPriorityAsync(TaskPriority priority)
Sets the priority to the given value
|
PgxFuture<java.lang.Void> |
CpuEnvironment.setWeightAsync(java.lang.Integer weight)
Sets the weight to the given value
|
<T> PgxFuture<T> |
ExecutionEnvironment.withMaxNumThreadsAsync(int maxNumThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with at most
maxNumThreads. |
<T> PgxFuture<T> |
CpuEnvironment.withMaxNumThreadsAsync(int maxNumThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given limit on the number of threads to use
|
<T> PgxFuture<T> |
IoEnvironment.withNumThreadsPerTaskAsync(int numThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the number of threads used for IO tasks
|
<T> PgxFuture<T> |
CpuEnvironment.withPriorityAsync(TaskPriority priority, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given priority.
|
<T> PgxFuture<T> |
CpuEnvironment.withWeightAsync(int weight, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given weight.
|
| Modifier and Type | Method and Description |
|---|---|
<T> T |
ExecutionEnvironment.withMaxNumThreads(int maxNumThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Blocking version of
ExecutionEnvironment.withMaxNumThreadsAsync(int, Supplier). |
<T> T |
CpuEnvironment.withMaxNumThreads(int maxNumThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Blocking version of
CpuEnvironment.withMaxNumThreadsAsync(int, Supplier). |
<T> PgxFuture<T> |
ExecutionEnvironment.withMaxNumThreadsAsync(int maxNumThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with at most
maxNumThreads. |
<T> PgxFuture<T> |
CpuEnvironment.withMaxNumThreadsAsync(int maxNumThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given limit on the number of threads to use
|
<T> T |
IoEnvironment.withNumThreadsPerTask(int numThreads, java.util.function.Supplier<PgxFuture<T>> asyncSupplier)
Blocking version of
IoEnvironment.withNumThreadsPerTaskAsync(int, Supplier). |
<T> PgxFuture<T> |
IoEnvironment.withNumThreadsPerTaskAsync(int numThreads, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the number of threads used for IO tasks
|
<T> T |
CpuEnvironment.withPriority(TaskPriority priority, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Blocking version of
CpuEnvironment.withPriorityAsync(TaskPriority, Supplier). |
<T> PgxFuture<T> |
CpuEnvironment.withPriorityAsync(TaskPriority priority, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given priority.
|
<T> T |
CpuEnvironment.withWeight(int weight, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Blocking version of
CpuEnvironment.withWeightAsync(int, Supplier). |
<T> PgxFuture<T> |
CpuEnvironment.withWeightAsync(int weight, java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given weight.
|
Copyright © 2017 Oracle Corp. All Rights Reserved.