| 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.
|
| oracle.pgx.api.graphalteration |
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph)
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
PgxFuture<EdgeProperty<java.lang.Double>> |
Analyst.adamicAdarCountingAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> aa)
The adamic-adar index compares the amount of neighbors shared between vertices, this measure can be used with communities.
|
abstract PgxFuture<java.lang.Void> |
PgxCollection.addAllAsync(java.util.Collection<E> source)
Deprecated.
since 2.7.0 - use
PgxCollection.addAllElementsAsync(Collection) instead.
Adds elements to an existing collection. |
PgxFuture<java.lang.Void> |
GraphEntityCollection.addAllAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ScalarCollection.addAllAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ComponentCollection.addAllAsync(java.util.Collection<PgxVertex<ID>> source) |
PgxFuture<java.lang.Void> |
PgxCollection.addAllAsync(E[] elements)
Add elements to an existing collection
|
PgxFuture<java.lang.Void> |
GraphEntityCollection.addAllByIdAsync(java.util.Collection<ID> source)
Adds vertices/edges to an existing collection using their assiated IDs
|
abstract PgxFuture<java.lang.Void> |
PgxCollection.addAllElementsAsync(java.util.Collection<E> source)
Adds elements to an existing collection.
|
PgxFuture<java.lang.Void> |
GraphEntityCollection.addAllElementsAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ScalarCollection.addAllElementsAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ServerInstance.addPinnedGraphAsync(GraphConfig cfg)
Add a pinned graph (will not be unloaded by engine) to be shared between sessions
|
PgxFuture<java.lang.Void> |
PgxGraph.addRedactionRuleAsync(PgxRedactionRuleConfig ruleConfig,
AuthorizationType type,
java.lang.String... names)
Add a redaction rule configuration for an AuthorizationType names.
|
static <T> PgxFuture<java.lang.Void> |
PgxFuture.allOf(java.util.List<PgxFuture<T>> promises) |
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<VertexSet<ID>,EdgeSet,PgxMap<PgxVertex<ID>,java.lang.Integer>>> |
Analyst.allReachableVerticesEdgesFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
EdgeFilter filter)
Finds all the vertices and edges on a path between the src and target of length smaller or equal to k.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityAsync(PgxGraph graph,
int k,
VertexProperty<ID,java.lang.Double> bc)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
PgxVertex<ID>... seeds)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc,
PgxVertex<ID>... seeds)
Faster, but less accurate than betweenness centrality, it identifies important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Boolean>> |
Analyst.bipartiteCheckAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Boolean> isLeft)
Bipartite check verifies whether are graph is a bipartite graph.
|
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<PgxGraph> |
GraphChangeSet.buildNewSnapshotAsync()
Builds a new snapshot of the graph out of
this GraphChangeSet: the resulting PgxGraph is a
new snapshot of the PgxGraph object this was created from. |
PgxFuture<PgxGraph> |
GraphChangeSetImpl.buildNewSnapshotAsync() |
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)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.centerAsync(PgxGraph graph,
VertexSet<ID> center)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
PgxFuture<java.lang.Void> |
PgxCollection.clearAsync()
Clear an existing collection
|
PgxFuture<java.lang.Void> |
ComponentCollection.clearAsync() |
PgxFuture<PgxGraph> |
PgxGraph.cloneAndExecutePgqlAsync(java.lang.String pgqlString)
(BETA) Convenience method of
PgxGraph.cloneAndExecutePgqlAsync(String, String)Passing String(name) as null
|
PgxFuture<PgxGraph> |
PgxGraph.cloneAndExecutePgqlAsync(java.lang.String pgqlString,
java.lang.String newGraphName)
(BETA) Convenience method for executing
PgxGraph.cloneAsync(String) on a graph and
PgxGraph.executePgqlAsync(String) on its result |
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<PgxCollection<E,ID>> |
PgxCollection.cloneAsync()
Convenience method around
PgxCollection.cloneAsync(String) passing name as null Clone an existing 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(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
java.lang.String newGraphName)
Creates a deep copy of this graph.
|
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.
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.cloneAsync(java.lang.String newName)
Clone an existing 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.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost)
Closenness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityDoubleLengthAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> cost,
VertexProperty<ID,java.lang.Double> cc)
Closenness centrality measures the centrality of the vertices based on weighted distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph)
Closenness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.closenessCentralityUnitLengthAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> cc)
Closenness centrality measures the centrality of the vertices based on distances, allowing to find well-connected vertices
|
<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)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
int max)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesConductanceMinimizationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Soman and Narang can find communities in a graph taking weighted edges into account
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
double tau,
double tol,
int maxIter,
VertexProperty<ID,java.lang.Long> module)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesInfomapAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Long> module)
Infomap can find high quality communities in a graph.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
int maxIterations)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
int maxIterations,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Label propagation can find communities in a graph relatively fast
|
<ID> PgxFuture<Partition<ID>> |
Analyst.communitiesLabelPropagationAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Label propagation can find communities in a graph relatively fast
|
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<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>> |
Analyst.computeHighDegreeVerticesAsync(PgxGraph graph,
int k)
Computes the k vertices with the highest degrees in the graph.
|
<ID> PgxFuture<Pair<PgxMap<java.lang.Integer,PgxVertex<ID>>,VertexSet<ID>>> |
Analyst.computeHighDegreeVerticesAsync(PgxGraph graph,
int k,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices)
Computes the k vertices with the highest degrees in the graph.
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex)
Conductance assesses the quality of a partition in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.conductanceAsync(PgxGraph graph,
Partition<ID> partition,
long partitionIndex,
Scalar<java.lang.Double> conductance)
Conductance assesses the quality of a partition in a graph
|
abstract PgxFuture<java.lang.Boolean> |
PgxCollection.containsAsync(E element)
Returns
true if this collection contains the specified element. |
PgxFuture<java.lang.Boolean> |
GraphEntityCollection.containsAsync(E element) |
PgxFuture<java.lang.Boolean> |
ScalarCollection.containsAsync(E 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)
triangle counting gives an overview of the amount of connections between vertices in neighborhoods
|
<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. |
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>> |
Analyst.createDistanceIndexAsync(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices)
Computes an index with distances to each high-degree vertex.
|
<ID> PgxFuture<VertexProperty<ID,PgxVect<java.lang.Integer>>> |
Analyst.createDistanceIndexAsync(PgxGraph graph,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes an index with distances to each high-degree vertex.
|
<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
|
PgxFuture<PgxGraph> |
PgxSession.createGraphFromFramesAsync(java.lang.String graphName,
oracle.pgx.api.beta.frames.PgxFrame vertexFrame,
oracle.pgx.api.beta.frames.PgxFrame edgeFrame)
Creates an homogeneous graph from the specified frames that represent the vertices and edges of the graph.
|
<K,V> PgxFuture<PgxMap<K,V>> |
PgxGraph.createMapAsync(PropertyType keyType,
PropertyType valType)
Creates a session-bound map
|
<K,V> PgxFuture<PgxMap<K,V>> |
PgxSession.createMapAsync(PropertyType keyType,
PropertyType valueType)
Convenience method around
PgxSession.createMapAsync(PropertyType, PropertyType, String) passing name as null. |
<K,V> PgxFuture<PgxMap<K,V>> |
PgxGraph.createMapAsync(PropertyType keyType,
PropertyType valType,
java.lang.String mapName)
Creates a session-bound map
|
<K,V> PgxFuture<PgxMap<K,V>> |
PgxSession.createMapAsync(PropertyType keyType,
PropertyType valueType,
java.lang.String name)
Creates a 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.
|
<T> PgxFuture<ScalarSequence<T>> |
PgxSession.createSequenceAsync(PropertyType contentType)
Convenience method around
PgxSession.createSequenceAsync(PropertyType, String) passing name as null. |
<T> PgxFuture<ScalarSequence<T>> |
PgxSession.createSequenceAsync(PropertyType contentType,
java.lang.String name)
Creates a sequence of scalars.
|
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<ScalarSet<T>> |
PgxSession.createSetAsync(PropertyType contentType)
Convenience method around
PgxSession.createSetAsync(PropertyType, String) passing name as null. |
<T> PgxFuture<ScalarSet<T>> |
PgxSession.createSetAsync(PropertyType contentType,
java.lang.String name)
Creates a set of scalars.
|
<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)
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<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)
Degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
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<GraphConfig> |
PgxSession.describeGraphFilesAsync(java.util.List<java.lang.String> filePaths)
Describes the graph contained in the files at the given paths.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFilesAsync(java.util.List<java.lang.String> filePaths,
Format format)
Describes the graph contained in the files at the given paths.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths)
Describes the graph contained in the files at the given paths.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format)
Describes the graph contained in the files at the given paths.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath)
Describes the graph contained in the files at the given paths.
|
PgxFuture<GraphConfig> |
PgxSession.describeGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format)
Describes the graph contained in the files at the given paths.
|
PgxFuture<java.lang.Void> |
Destroyable.destroyAsync()
Requests destruction of this object.
|
PgxFuture<java.lang.Void> |
ComponentCollection.destroyAsync(boolean ignoreNotFound) |
PgxFuture<java.lang.Void> |
Partition.destroyAsync(boolean ignoreNotFound) |
PgxFuture<java.lang.Void> |
PgxGraph.destroyEdgePropertyIfExistsAsync(java.lang.String name)
Destroys an edge property if it exists.
|
PgxFuture<java.lang.Void> |
PgxGraph.destroyVertexPropertyIfExistsAsync(java.lang.String name)
Destroys a vertex property if it exists.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Integer>,VertexProperty<ID,java.lang.Integer>>> |
Analyst.diameterAsync(PgxGraph graph)
Diameter/radius gives an overview of the distances in a 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)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
int max,
double maxDiff,
boolean useL2Norm,
boolean useInEdge)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<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)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.eigenvectorCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> ec)
Eigenvector centrality gets the centrality of the vertices in an intrincated way using neighbors, allowing to find well-connected vertices
|
PgxFuture<MapIterable<K,V>> |
PgxMap.entriesAsync()
Gets an entry set.
|
<ID> PgxFuture<org.apache.commons.lang3.tuple.Triple<ScalarSequence<java.lang.Integer>,VertexSequence<ID>,EdgeSequence>> |
Analyst.enumerateSimplePathsAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int k,
VertexSet verticesOnPath,
EdgeSet edgesOnPath,
PgxMap<PgxVertex<ID>,java.lang.Integer> dist)
Enumerate all simple paths between the source and destination vertex
|
PgxFuture<T> |
PgxFuture.exceptionally(java.util.function.Function<java.lang.Throwable,? extends T> fn) |
static <T> PgxFuture<T> |
PgxFuture.exceptionallyCompletedFuture(java.lang.Throwable throwable) |
PgxFuture<java.lang.Boolean> |
PgxPreparedStatement.executeAsync()
Executes the PGQL statement in this PreparedStatement object, which may be any kind of PGQL statement.
|
PgxFuture<PgqlResultSet> |
PgxGraph.executePgqlAsync(java.lang.String pgqlString)
(BETA) Submits a PGQL (both select and modify) query.
|
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<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()
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.
|
<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.
|
PgxFuture<Operation> |
PgxGraph.explainPgqlAsync(java.lang.String pgqlString)
Explain the execution plan of a pattern matching query.
|
PgxFuture<Operation> |
PgxSession.explainPgqlAsync(java.lang.String pgqlString)
Explain the execution plan of a pattern matching query.
|
<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)
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
<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)
Fattest path is a fast algorithm for finding a shortest path adding constraints for flowing related matters
|
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)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth)
A Breadth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter) instead |
<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)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean) instead |
<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,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, int) instead |
<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,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, int,
VertexProperty, VertexProperty) instead |
<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)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty,
VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredBfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredBfsAsync(PgxGraph, PgxVertex, VertexFilter, int) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter navigator,
int maxDepth)
A Depth-First Search implementation with an option to filter edges during the traversal of the graph.
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex,VertexFilter, boolean) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, int) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
int maxDepth,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty, VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
boolean initWithInf,
VertexProperty<ID,java.lang.Integer> distance,
VertexProperty<ID,PgxVertex<ID>> parent)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, boolean, VertexProperty, VertexProperty) instead |
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Integer>,VertexProperty<ID,PgxVertex<ID>>>> |
Analyst.filteredDfsAsync(PgxGraph graph,
PgxVertex<ID> root,
VertexFilter filter,
VertexFilter navigator,
int maxDepth)
Deprecated.
since 20.1.0 - use
Analyst.filteredDfsAsync(PgxGraph, PgxVertex, VertexFilter, int) instead |
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
PgxVertex<ID> src)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
PgxVertex<ID> src,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq)
Find cycle looks for any loop in the graph.
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.findCycleAsync(PgxGraph graph,
VertexSequence<ID> nodeSeq,
EdgeSequence edgeSeq)
Find cycle looks for any loop in the graph.
|
PgxFuture<oracle.pgx.common.pojo.admin.CacheStatistics> |
ServerInstance.freeCachedMemoryAsync()
Trigger memory cleanup to free unused graphs if RELEASE_MEMORY_THRESHOLD is reached
|
PgxFuture<oracle.pgx.common.pojo.admin.CacheStatistics> |
ServerInstance.freeCachedMemoryAsync(double threshold)
Trigger memory cleanup to free unused graphs if threshold is reached.
|
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)
Deprecated.
since 20.0.0, as snapshots of a graph with "snapshots_source=CHANGE_SET" are not visible from here;
use
PgxSession.getAvailableSnapshotsAsync(PgxGraph) instead |
PgxFuture<java.util.Deque<GraphMetaData>> |
PgxSession.getAvailableSnapshotsAsync(PgxGraph graph)
Gets a list of the
GraphMetaData information of available in-memory snapshots of graph. |
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<Control> |
ServerInstance.getControl() |
PgxFuture<oracle.pgx.api.internal.Core> |
ServerInstance.getCore() |
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(Namespace namespace,
java.lang.String name)
Gets an edge property of this graph in the given namespace.
|
<V> PgxFuture<EdgeProperty<V>> |
PgxGraph.getEdgePropertyAsync(java.lang.String name)
Gets an edge property of this graph
The property will be first looked up in the session private namespace, if it is not found there it will be looked
up in the public namespace.
|
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<EdgeSet> |
PgxGraph.getEdgesAsync(EdgeFilter filter,
java.lang.String name)
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(Namespace namespace,
java.lang.String name)
References a graph with name
name within the given namespace:
- if namespace is Namespace.PRIVATE, than the search occurs on already referenced snapshots of the
graph with name name and the most recent snapshot is returned
- if namespace is Namespace.PUBLIC, then the search occurs on published graphs and the most recent
snapshot of the published graph with name name is returned
- if namespace is null, then the PRIVATE namespace is searched first and, if no snapshot is found,
the PUBLIC namespace is then searched, according to the shadowing rules
Multiple calls of this method with the same parameters will return different PgxGraph objects referencing
the same graph, with the server keeping track of how many references a session has to each graph. |
PgxFuture<PgxGraph> |
PgxSession.getGraphAsync(java.lang.String name)
References a graph with name
name loaded inside PGX. |
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
ServerInstance.getGraphInfoAsync(java.lang.String graphName)
Deprecated.
since 2.7.0, use
ServerInstance.getServerStateAsync() |
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
ServerInstance.getGraphInfoAsync(java.lang.String sessionId,
java.lang.String graphName)
Deprecated.
since 2.7.0, use
ServerInstance.getServerStateAsync() |
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.GraphInfo>> |
ServerInstance.getGraphInfosAsync()
Deprecated.
|
PgxFuture<java.util.Map<java.lang.String,PgxGraph>> |
PgxSession.getGraphsAsync()
Deprecated.
since 19.4.0; use
PgxSession.getGraphsAsync(Namespace) instead |
PgxFuture<java.util.List<java.lang.String>> |
PgxSession.getGraphsAsync(Namespace namespace)
Returns a collection of graph names accessible under the given namespace.
|
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()
Deprecated.
since 2.7.0, use
ServerInstance.getServerStateAsync() |
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.
|
<V> PgxFuture<EdgeProperty<V>> |
PgxGraph.getOrCreateEdgePropertyAsync(PropertyType type,
java.lang.String name)
Gets or creates an edge property
|
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.getOrCreateEdgeVectorPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Gets or creates an edge vector property
|
<V> PgxFuture<EdgeProperty<PgxVect<V>>> |
PgxGraph.getOrCreateEdgeVertexPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Gets or creates an edge vector property
|
<ID,V> PgxFuture<VertexProperty<ID,V>> |
PgxGraph.getOrCreateVertexPropertyAsync(PropertyType type,
java.lang.String name)
Gets or creates a vertex property
|
<ID,V> PgxFuture<VertexProperty<ID,PgxVect<V>>> |
PgxGraph.getOrCreateVertexVectorPropertyAsync(PropertyType type,
int dimension,
java.lang.String name)
Gets or creates a vertex vector property
|
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()
Deprecated.
since 2.7.0, use
ServerInstance.getVersionAsync() to get the PGX version |
<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<java.util.List<PgxRedactionRuleConfig>> |
PgxGraph.getRedactionRulesAsync(AuthorizationType type,
java.lang.String name)
Gets redaction rules for an AuthorizationType name.
|
PgxFuture<PgqlResultSet> |
PgxPreparedStatement.getResultSetAsync()
Retrieves the current result as a PgxFuture with the ResultSet object.
|
PgxFuture<com.fasterxml.jackson.databind.JsonNode> |
ServerInstance.getServerStateAsync()
Gets the server state info.
|
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)
Deprecated.
since 2.7.0, use
ServerInstance.getServerStateAsync() |
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.SessionInfo>> |
ServerInstance.getSessionInfosAsync()
Deprecated.
since 2.7.0, use
ServerInstance.getServerStateAsync() |
<ID> PgxFuture<PgxVertex<ID>> |
PgxEdge.getSourceAsync()
Gets the source vertex.
|
PgxFuture<oracle.pgx.common.pojo.admin.PoolInfo> |
ServerInstance.getThreadPoolInfoAsync(PoolType type)
Deprecated.
since 2.7.0, use
ServerInstance.getServerStateAsync() |
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.
|
PgxFuture<oracle.pgx.common.VersionInfo> |
ServerInstance.getVersionAsync()
Gets the PGX extended version of this instance.
|
<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(Namespace namespace,
java.lang.String name)
Gets a vertex property of this graph in the given namespace.
|
<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.Void> |
PgxGraph.grantPermissionAsync(oracle.pgx.common.auth.PgxRole role,
oracle.pgx.common.auth.PgxResourcePermission permission)
Grants a permission on this graph to the given role.
|
PgxFuture<java.lang.Void> |
PgxGraph.grantPermissionAsync(oracle.pgx.common.auth.PgxUser user,
oracle.pgx.common.auth.PgxResourcePermission permission)
Grants a permission on this graph to the given user.
|
<U> PgxFuture<U> |
PgxFuture.handle(java.util.function.BiFunction<? super T,java.lang.Throwable,? extends U> fn) |
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)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<Pair<VertexProperty<ID,java.lang.Double>,VertexProperty<ID,java.lang.Double>>> |
Analyst.hitsAsync(PgxGraph graph,
int max)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<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)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<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)
HITS assigns ranking scores to the vertices, aimed to assess the quality of information and references in linked structures
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.inDegreeCentralityAsync(PgxGraph graph)
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<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)
In-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph)
In-degree distribution gives information about the incoming flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.inDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution)
In-degree distribution gives information about the incoming flows in a graph
|
<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 collection is mutable
|
PgxFuture<java.lang.Boolean> |
ComponentCollection.isMutableAsync() |
PgxFuture<java.lang.Boolean> |
PgxGraph.isPublishedAsync()
Checks if this graph is published.
|
PgxFuture<java.lang.Boolean> |
Property.isPublishedAsync()
Checks if this property is published.
|
PgxFuture<java.lang.Boolean> |
PgxGraph.isPublishedWithSnapshotsAsync()
Checks if this graph is published with snapshots.
|
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)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<ID> PgxFuture<Pair<Scalar<java.lang.Long>,VertexProperty<ID,java.lang.Long>>> |
Analyst.kcoreAsync(PgxGraph graph,
int minCore,
int maxCore)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<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)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
<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)
k-core decomposes a graph into layers revealing subgraphs with particular properties
|
PgxFuture<java.lang.Iterable<K>> |
PgxMap.keysAsync() |
PgxFuture<java.lang.Void> |
ServerInstance.killSessionAsync(java.lang.String sessionId)
Kill a session.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,EdgeSequence>> |
Analyst.limitedShortestPathHopDistFilteredAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
int maxHops,
PgxMap<java.lang.Integer,PgxVertex<ID>> highDegreeVertexMapping,
VertexSet<ID> highDegreeVertices,
VertexProperty<ID,PgxVect<java.lang.Integer>> index,
EdgeFilter filter,
VertexSequence<ID> pathVertices,
EdgeSequence pathEdges)
Computes the k-hop limited shortest path between two vertices.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph)
LCC gives information about potential clustering options in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.localClusteringCoefficientAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> lcc)
LCC gives information about potential clustering options in a graph
|
PgxFuture<GraphConfig> |
ServerInstance.lookupPreloadedGraphAsync(java.lang.String name)
Deprecated.
since 2.7.0
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter)
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Long>> |
Analyst.louvainAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
int maxIter,
int nbrPass,
double tol,
VertexProperty<ID,java.lang.Long> community)
Louvain can detect communities in a large graph relatively fast.
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
double learningRate,
double changePerStep,
double lambda,
int maxStep,
int vectorLength)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<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)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> PgxFuture<MatrixFactorizationModel<ID>> |
Analyst.matrixFactorizationGradientDescentAsync(BipartiteGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,PgxVect<java.lang.Double>> features)
Matrix factorization can be used as a recommendation algorithm for bipartite graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.matrixFactorizationRecommendationsAsync(BipartiteGraph graph,
PgxVertex<ID> user,
int vectorLength,
VertexProperty<ID,PgxVect<java.lang.Double>> feature,
VertexProperty<ID,java.lang.Double> estimatedRating)
Estimate rating can be used as a prediction algorithm for bipartite graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.outDegreeCentralityAsync(PgxGraph graph)
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
<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)
Out-degree centrality measures the centrality of the vertices based on its degree, letting you see how a vertex influences its neighborhood
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph)
Out-degree distribution gives information about the outgoing flows in a graph
|
PgxFuture<PgxMap<java.lang.Integer,java.lang.Long>> |
Analyst.outDegreeDistributionAsync(PgxGraph graph,
PgxMap<java.lang.Integer,java.lang.Long> distribution)
Out-degree distribution gives information about the outgoing flows in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankApproximateAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank)
Faster, but less accurate than pagerank.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
boolean norm)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm)
PageRank computes ranking scores based on the edges in a graph.
|
<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)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
double e,
double d,
int max,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.pagerankAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> rank)
PageRank computes ranking scores based on the edges in a graph.
|
<ID> PgxFuture<Pair<Scalar<java.lang.Double>,Scalar<java.lang.Double>>> |
Analyst.partitionConductanceAsync(PgxGraph graph,
Partition<ID> partition)
Partition conductance assesses the quality of many partitions in a graph
|
<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)
Partition conductance assesses the quality of many partitions in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition)
Modularity summarizes information about the quality of components in a graph
|
<ID> PgxFuture<Scalar<java.lang.Double>> |
Analyst.partitionModularityAsync(PgxGraph graph,
Partition<ID> partition,
Scalar<java.lang.Double> modularity)
Modularity summarizes information about the quality of components in a graph
|
<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)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexSet<ID>> |
Analyst.peripheryAsync(PgxGraph graph,
VertexSet<ID> periphery)
Periphery/center gives an overview of the extreme distances and the corresponding vertices in a graph
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
double e,
double d,
int max,
boolean norm)
Personalized PageRank for a vertex of interest.
|
<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)
Personalized PageRank for a vertex of interest.
|
<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)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
double e,
double d,
int max,
boolean norm)
Personalized PageRank for a set of vertices of interest.
|
<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)
Personalized PageRank for a set of vertices of interest.
|
<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)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> rank)
Personalized PageRank for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v)
Personalized salsa for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v,
double d,
int maxIter,
double maxDiff)
Personalized salsa for a vertex of interest.
|
<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)
Personalized salsa for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph,
PgxVertex<ID> v,
VertexProperty<ID,java.lang.Double> salsaRank)
Personalized salsa for a vertex of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices)
Personalized salsa for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices,
double d,
int maxIter,
double maxDiff)
Personalized salsa for a set of vertices of interest.
|
<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)
Personalized salsa for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedSalsaAsync(BipartiteGraph graph,
VertexSet<ID> vertices,
VertexProperty<ID,java.lang.Double> salsaRank)
Personalized salsa for a set of vertices of interest.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<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)
Personalized weighted pagerank for a vertex and weighted edges.
|
<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)
Personalized weighted pagerank for a vertex and weighted edges.
|
<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)
Personalized weighted pagerank for a vertex and weighted edges.
|
<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)
Personalized weighted pagerank for a vertex and weighted edges.
|
<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)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
PgxVertex<ID> v,
EdgeProperty<java.lang.Double> weight)
Personalized weighted pagerank for a vertex and weighted edges.
|
<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)
Personalized weighted pagerank for a vertex and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
boolean norm,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<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)
Personalized pagerank for a set of vertices and weighted edges.
|
<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)
Personalized pagerank for a set of vertices and weighted edges.
|
<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)
Personalized pagerank for a set of vertices and weighted edges.
|
<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)
Personalized pagerank for a set of vertices and weighted edges.
|
<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)
Personalized pagerank for a set of vertices and weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.personalizedWeightedPagerankAsync(PgxGraph graph,
VertexSet<ID> vertices,
EdgeProperty<java.lang.Double> weight)
Personalized pagerank for a set of vertices and weighted edges.
|
<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)
Personalized pagerank for a set of vertices and weighted edges.
|
<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 select only query.
|
PgxFuture<PgxPreparedStatement> |
PgxSession.preparePgqlAsync(java.lang.String pgqlString)
Prepares a pattern matching query with a FROM-statements.
|
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
prim reveals tree structures with shortest paths in a graph
|
PgxFuture<EdgeProperty<java.lang.Boolean>> |
Analyst.primAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
EdgeProperty<java.lang.Boolean> mst)
prim reveals tree structures with shortest paths in a graph
|
PgxFuture<java.lang.Void> |
PgxGraph.publishAsync()
Publishes the graph so it can be shared between sessions.
|
PgxFuture<java.lang.Void> |
Property.publishAsync()
Publishes the property into a shared graph so It can be shared between sessions.
|
PgxFuture<java.lang.Void> |
PgxGraph.publishAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps)
Publishes the graph so It can be shared between sessions.
|
PgxFuture<java.lang.Void> |
PgxGraph.publishWithSnapshotsAsync()
Publishes the graph and all its snapshots so they can be shared between sessions.
|
PgxFuture<java.lang.Void> |
PgxGraph.publishWithSnapshotsAsync(java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps)
Publishes the graph and all its snapshots so they can be shared between sessions.
|
PgxFuture<java.lang.Void> |
PgxMap.putAsync(K key,
V value)
Sets the value for a key in the map specified by the given name.
|
PgxFuture<PgqlResultSet> |
PgxGraph.queryPgqlAsync(java.lang.String pgqlString)
Submits a pattern matching select only query.
|
PgxFuture<PgqlResultSet> |
PgxSession.queryPgqlAsync(java.lang.String pgqlString)
Submits a pattern matching query with a FROM-statements.
|
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)
Diameter/radius gives an overview of the distances in a 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)
Diameter/radius gives an overview of the distances in a graph
|
<ID> PgxFuture<PgxMap<PgxVertex<ID>,java.lang.Integer>> |
Analyst.randomWalkWithRestartAsync(PgxGraph graph,
PgxVertex<ID> source,
int length,
double resetProb,
PgxMap<PgxVertex<ID>,java.lang.Integer> visitCount)
random walk with restart does the what its name says, it can find approximate stationary distributions
|
<ID> PgxFuture<java.lang.Integer> |
Analyst.reachabilityAsync(PgxGraph graph,
PgxVertex<ID> source,
PgxVertex<ID> dest,
int maxHops,
boolean ignoreEdgeDirection)
Reachability is a fast way to check if two vertices are reachable from each other.
|
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)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths,
Format format)
Loads the graph contained in the files at the given paths.
|
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.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
Format format,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> vertexFilePaths,
java.util.List<java.lang.String> edgeFilePaths,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.util.List<java.lang.String> filePaths,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
Format format,
java.lang.String newGraphName)
Loads the graph contained in the files at the given paths.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphFilesAsync(java.lang.String vertexFilePath,
java.lang.String edgeFilePath,
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 in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
boolean updateIfNotFresh)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
boolean updateIfNotFresh,
java.lang.String newGraphName)
Reads a graph and its properties, specified in the graph config, into memory.
|
PgxFuture<PgxGraph> |
PgxSession.readGraphWithPropertiesAsync(GraphConfig config,
long maxAge,
java.util.concurrent.TimeUnit maxAgeTimeUnit)
Reads a graph and its properties, specified in the 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 in the 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.
|
abstract PgxFuture<java.lang.Void> |
PgxCollection.removeAllAsync(java.util.Collection<E> source)
Deprecated.
since 2.7.0 - use
PgxCollection.removeAllElementsAsync(Collection) instead.
Removes elements from an existing collection. |
PgxFuture<java.lang.Void> |
GraphEntityCollection.removeAllAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ScalarCollection.removeAllAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ComponentCollection.removeAllAsync(java.util.Collection<PgxVertex<ID>> source) |
PgxFuture<java.lang.Void> |
GraphEntityCollection.removeAllByIdAsync(java.util.Collection<ID> source)
Removes vertices/edges from an existing vertex/edge collection using their assiated IDs
|
abstract PgxFuture<java.lang.Void> |
PgxCollection.removeAllElementsAsync(java.util.Collection<E> source)
Removes elements from an existing collection.
|
PgxFuture<java.lang.Void> |
GraphEntityCollection.removeAllElementsAsync(java.util.Collection<E> source) |
PgxFuture<java.lang.Void> |
ScalarCollection.removeAllElementsAsync(java.util.Collection<E> 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> |
PgxGraph.removeRedactionRuleAsync(PgxRedactionRuleConfig ruleConfig,
AuthorizationType type,
java.lang.String... names)
Removes a redaction rule for AuthorizationType names.
|
PgxFuture<java.lang.Void> |
PgxGraph.renameAsync(java.lang.String newGraphName)
Renames this graph.
|
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
|
PgxFuture<java.lang.Void> |
PgxGraph.revokePermissionAsync(oracle.pgx.common.auth.PgxRole role)
Revokes all permissions on this graph from the given role.
|
PgxFuture<java.lang.Void> |
PgxGraph.revokePermissionAsync(oracle.pgx.common.auth.PgxUser user)
Revokes all permissions on this graph from the given user.
|
PgxFuture<java.util.List<?>> |
PgxSession.runConcurrentlyAsync(java.util.List<java.util.function.Supplier<PgxFuture<?>>> asyncRequestsSuppliers)
Submits lists of supplied functions to run concurrently in the server
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph)
SALSA computes ranking scores.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph,
double maxDiff,
int maxIter)
SALSA computes ranking scores.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph,
double maxDiff,
int maxIter,
VertexProperty<ID,java.lang.Double> salsaRank)
SALSA computes ranking scores.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.salsaAsync(BipartiteGraph graph,
int k)
Deprecated.
since 2.7.0 - use
Analyst.salsaAsync(BipartiteGraph) instead |
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.salsaAsync(BipartiteGraph graph,
int k,
double maxDiff,
double d,
int maxIter)
Deprecated.
since 2.7.0 - use
Analyst.salsaAsync(BipartiteGraph, double, int) instead |
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.salsaAsync(BipartiteGraph graph,
VertexProperty<ID,java.lang.Double> salsaRank)
SALSA computes ranking scores.
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph)
Kosaraju finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccKosarajuAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitionDistribution)
Kosaraju finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph)
Tarjan finds strongly connected components in a graph
|
<ID> PgxFuture<Partition<ID>> |
Analyst.sccTarjanAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Long> partitonDistribution)
Tarjan finds strongly connected components in a graph
|
PgxFuture<java.lang.Void> |
PgxMap.setAsync(K key,
V value)
Deprecated.
since 3.2.0, use
PgxMap.putAsync(Object, Object) instead |
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)
Bellman-ford finds multiple shortest paths at the same time
|
<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)
Bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathBellmanFordReverseAsync(PgxGraph graph,
PgxVertex<ID> src,
EdgeProperty<java.lang.Double> cost)
Reversed bellman-ford finds multiple shortest paths at the same time
|
<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)
Reversed bellman-ford finds multiple shortest paths at the same time
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost)
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<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)
Dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost)
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<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)
Bidirectional dijkstra is a fast algorithm for finding a shortest path in a graph
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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)
Filtered Dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<PgxPath<ID>> |
Analyst.shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph,
PgxVertex<ID> src,
PgxVertex<ID> dst,
EdgeProperty<java.lang.Double> cost,
GraphFilter filterExpr)
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<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)
Bidirectional dijkstra is a fast algorithm for finding a shortest path while also filtering edges
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistAsync(PgxGraph graph,
PgxVertex<ID> src)
Hop distance can give a relatively fast insight on the distances in a graph
|
<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)
Hop distance can give a relatively fast insight on the distances in a graph
|
<ID> PgxFuture<AllPaths<ID>> |
Analyst.shortestPathHopDistReverseAsync(PgxGraph graph,
PgxVertex<ID> src)
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
<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)
Backwards hop distance can give a relatively fast insight on the distances in a graph
|
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 getId() |
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.ALL
Create 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_COPY
Create a simplified version of a graph. |
PgxFuture<java.lang.Integer> |
PgxCollection.sizeAsync()
Gets the number of elements in this collection
|
PgxFuture<java.lang.Integer> |
PgxMap.sizeAsync()
Returns the size of the map
|
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,
FileGraphStoringConfig storingConfig)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat,
FileGraphStoringConfig storingConfig,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat,
FileGraphStoringConfig storingConfig,
java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
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<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat,
java.lang.String targetBasePath,
int numPartitions)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat,
java.lang.String targetBasePath,
int numPartitions,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<FileGraphConfig> |
PgxGraph.storeAsync(Format targetFormat,
java.lang.String targetBasePath,
int numPartitions,
java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<GraphConfig> |
PgxGraph.storeAsync(GraphConfig targetConfig,
boolean overwrite)
Stores this graph in a file or database.
|
PgxFuture<GraphConfig> |
PgxGraph.storeAsync(GraphConfig targetConfig,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
boolean overwrite)
Stores this graph in a file or database.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.util.Map<java.lang.String,FileGraphStoringConfig> vertexStoringConfigs,
java.util.Map<java.lang.String,FileGraphStoringConfig> edgeStoringConfigs)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.util.Map<java.lang.String,FileGraphStoringConfig> vertexStoringConfigs,
java.util.Map<java.lang.String,FileGraphStoringConfig> edgeStoringConfigs,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.util.Map<java.lang.String,FileGraphStoringConfig> vertexStoringConfigs,
java.util.Map<java.lang.String,FileGraphStoringConfig> edgeStoringConfigs,
java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
java.util.Map<java.lang.String,FileGraphStoringConfig> vertexStoringConfigs,
java.util.Map<java.lang.String,FileGraphStoringConfig> edgeStoringConfigs,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
java.util.Map<java.lang.String,FileGraphStoringConfig> vertexStoringConfigs,
java.util.Map<java.lang.String,FileGraphStoringConfig> edgeStoringConfigs,
java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath)
Stores this graph in a given file format on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
boolean overwrite)
Stores this graph in a given file format on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
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<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
int numPartitions)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
int numPartitions,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
int numPartitions,
java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
int numPartitions,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
int numPartitions,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
int numPartitions,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
java.util.Collection<VertexProperty<?,?>> vertexProps,
java.util.Collection<EdgeProperty<?>> edgeProps,
boolean overwrite)
Stores this graph in a given file format in multiple partitions on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore)
Stores this graph in a given file format on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
boolean overwrite)
Stores this graph in a given file format on a file system.
|
PgxFuture<PartitionedGraphConfig> |
PgxGraph.storeAsync(ProviderFormat targetFormat,
java.lang.String targetBasePath,
java.util.Set<java.lang.String> vertexProvidersToStore,
java.util.Set<java.lang.String> edgeProvidersToStore,
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<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.
|
default PgxFuture<oracle.pgx.api.beta.frames.PgxFrame> |
PgqlResultSet.toFrameAsync()
Copies the content of this result set into a new PgxFrame.
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.toMutableAsync()
Create a mutable copy of an existing collection
|
PgxFuture<PgxCollection<E,ID>> |
PgxCollection.toMutableAsync(java.lang.String newName)
Create a mutable copy of an existing collection
|
PgxFuture<PgxCollection<PgxVertex<ID>,ID>> |
ComponentCollection.toMutableAsync(java.lang.String newName) |
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source)
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalScheduleAsync(PgxGraph graph,
VertexSet<ID> source,
VertexProperty<ID,java.lang.Integer> topoSched)
Topological schedule gives an order of visit for the reachable vertices from the source
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalSortAsync(PgxGraph graph)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Integer>> |
Analyst.topologicalSortAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Integer> topoSort)
Topological sort gives an order of visit for vertices in directed acyclic graphs
|
PgxFuture<PgxGraph> |
PgxGraph.transposeAsync()
Convenience method around
PgxGraph.transposeAsync(String) passing null as getId() |
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 getId() |
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 getId() |
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 |
PgxFuture<java.lang.Void> |
ServerInstance.updatePgxConfigAsync(java.io.InputStream config)
Replaces the current PGX config with the given configuration.
|
PgxFuture<java.lang.Void> |
ServerInstance.updatePgxConfigAsync(java.util.Map<PgxConfig.Field,java.lang.Object> config)
Replaces the current PGX config with the given configuration.
|
PgxFuture<java.lang.Void> |
ServerInstance.updatePgxConfigAsync(PgxConfig config)
Replaces the current PGX config with the given configuration.
|
PgxFuture<java.lang.Void> |
ServerInstance.updatePgxConfigAsync(java.lang.String path)
Replaces the current PGX config with the given configuration.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph)
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.vertexBetweennessCentralityAsync(PgxGraph graph,
VertexProperty<ID,java.lang.Double> bc)
Betweenness centrality measures the centrality of the vertices to identify important vertices for the flow of information
|
<ID> PgxFuture<Partition<ID>> |
Analyst.wccAsync(PgxGraph graph)
Identifying weakly connected components can be useful for clustering graph data
|
<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> partitionDistribution)
Identifying weakly connected components can be useful for clustering graph data
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
boolean norm,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
boolean norm,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<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)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
double e,
double d,
int max,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<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)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight)
PageRank on weighted edges.
|
<ID> PgxFuture<VertexProperty<ID,java.lang.Double>> |
Analyst.weightedPagerankAsync(PgxGraph graph,
EdgeProperty<java.lang.Double> weight,
VertexProperty<ID,java.lang.Double> rank)
PageRank on weighted edges.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust)
WTF is a recommendation algorithm.
|
<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)
WTF is a recommendation algorithm.
|
<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)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
int sizeCircleOfTrust,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
int topK,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
<ID> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>> |
Analyst.whomToFollowAsync(PgxGraph graph,
PgxVertex<ID> vertex,
VertexSequence<ID> hubs,
VertexSequence<ID> authorities)
WTF is a recommendation algorithm.
|
| 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) |
java.util.List<?> |
PgxSession.runConcurrently(java.util.List<java.util.function.Supplier<PgxFuture<?>>> asyncRequest)
Blocking version of
#runConcurrentlyAsync(List. |
PgxFuture<java.util.List<?>> |
PgxSession.runConcurrentlyAsync(java.util.List<java.util.function.Supplier<PgxFuture<?>>> asyncRequestsSuppliers)
Submits lists of supplied functions to run concurrently in the server
|
| 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.CacheStatistics> |
Control.freeCachedMemory()
Trigger memory cleanup to free unused graphs if RELEASE_MEMORY_THRESHOLD is reached
|
PgxFuture<oracle.pgx.common.pojo.admin.CacheStatistics> |
Control.freeCachedMemory(double threshold)
Trigger memory cleanup to free unused graphs if threshold is reached
|
PgxFuture<oracle.pgx.common.VersionInfo> |
Control.getExtendedVersion()
Gets an extended version.
|
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
Control.getGraphInfo(java.lang.String graphName)
Deprecated.
since 2.7.0
|
PgxFuture<oracle.pgx.common.pojo.admin.GraphInfo> |
Control.getGraphInfo(java.lang.String sessionId,
java.lang.String graphName)
Deprecated.
since 2.7.0
|
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.GraphInfo>> |
Control.getGraphInfos()
Deprecated.
since 2.7.0
|
PgxFuture<oracle.pgx.common.pojo.admin.MemoryInfo> |
Control.getMemoryInfo()
Deprecated.
since 2.7.0
|
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<com.fasterxml.jackson.databind.JsonNode> |
Control.getServerState()
Gets the server state.
|
PgxFuture<oracle.pgx.common.pojo.admin.SessionInfo> |
Control.getSessionInfo(java.lang.String sessionId)
Deprecated.
since 2.7.0
|
PgxFuture<java.util.Collection<oracle.pgx.common.pojo.admin.SessionInfo>> |
Control.getSessionInfos()
Deprecated.
since 2.7.0
|
PgxFuture<oracle.pgx.common.pojo.admin.PoolInfo> |
Control.getThreadPoolInfo(PoolType type)
Deprecated.
since 2.7.0
|
PgxFuture<java.lang.String> |
Control.getVersion() |
PgxFuture<java.lang.Boolean> |
Control.isRunning()
Check if the engine is currently up
|
PgxFuture<java.lang.Boolean> |
AbstractEmbeddedControl.isRunning() |
PgxFuture<com.fasterxml.jackson.databind.JsonNode> |
Control.joinMachine(java.lang.String hostname,
long raftId)
Join a machine to an existing PGX.D cluster.
|
PgxFuture<java.lang.Void> |
Control.killSession(java.lang.String sessionId)
Kill session.
|
PgxFuture<GraphConfig> |
Control.lookupPreloadedGraph(java.lang.String name)
Deprecated.
since 2.7.0
|
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> |
AbstractEmbeddedControl.shutdownNow() |
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) |
PgxFuture<java.lang.Void> |
Control.start(java.lang.String json,
java.lang.String keystorePath,
char[] keystorePassword) |
PgxFuture<java.lang.Void> |
AbstractEmbeddedControl.throwIfNotRunningAsync() |
PgxFuture<java.lang.Void> |
Control.updatePgxConfig(java.io.InputStream config)
Replaces the current PGX config with the given configuration.
|
PgxFuture<java.lang.Void> |
Control.updatePgxConfig(java.util.Map<PgxConfig.Field,java.lang.Object> config)
Replaces the current PGX config with the given configuration.
|
default PgxFuture<java.lang.Void> |
Control.updatePgxConfig(PgxConfig config)
Replaces the current PGX config with the given configuration.
|
PgxFuture<java.lang.Void> |
Control.updatePgxConfig(java.lang.String json)
Replaces the current PGX config with the given configuration.
|
| Modifier and Type | Method and Description |
|---|---|
PgxFuture<java.lang.Boolean> |
ExecutionEnvironment.allowsConcurrentTasksAsync()
Checks if the session allows the tasks to run concurrently.
|
PgxFuture<java.lang.Integer> |
CpuEnvironment.getMaxNumThreadsAsync() |
PgxFuture<java.lang.Integer> |
IoEnvironment.getNumThreadsPerTaskAsync() |
PgxFuture<TaskPriority> |
CpuEnvironment.getPriorityAsync() |
PgxFuture<UpdateConsistencyModel> |
ExecutionEnvironment.getUpdateConsistencyModelAsync()
Gets the consistency model to be used with in-place updates (if enabled).
|
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> |
ExecutionEnvironment.resetUpdateConsistencyModelAsync()
Resets the consistency model to be used with in-place updates (if enabled) to the default value, as configured
in
PgxConfig.getInPlaceUpdateConsistencyModel() |
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> |
ExecutionEnvironment.setUpdateConsistencyModelAsync(UpdateConsistencyModel model)
Sets the consistency model to be used with in-place updates (if enabled).
|
PgxFuture<java.lang.Void> |
CpuEnvironment.setWeightAsync(java.lang.Integer weight)
Sets the weight to the given value
|
<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> |
ExecutionEnvironment.withMaxNumThreadsAsync(int maxNumThreads,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with at most
maxNumThreads. |
<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> |
ExecutionEnvironment.withUpdateConsistencyModelAsync(UpdateConsistencyModel model,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given consistency model (only relevant if in-place updates are
enabled).
|
<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 |
CpuEnvironment.withMaxNumThreads(int maxNumThreads,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Blocking version of
CpuEnvironment.withMaxNumThreadsAsync(int, Supplier). |
<T> T |
ExecutionEnvironment.withMaxNumThreads(int maxNumThreads,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Blocking version of
ExecutionEnvironment.withMaxNumThreadsAsync(int, Supplier). |
<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> |
ExecutionEnvironment.withMaxNumThreadsAsync(int maxNumThreads,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with at most
maxNumThreads. |
<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 |
ExecutionEnvironment.withUpdateConsistencyModel(UpdateConsistencyModel model,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
|
<T> PgxFuture<T> |
ExecutionEnvironment.withUpdateConsistencyModelAsync(UpdateConsistencyModel model,
java.util.function.Supplier<PgxFuture<T>> asyncRequest)
Executes the given asynchronous request with the given consistency model (only relevant if in-place updates are
enabled).
|
<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.
|
| Modifier and Type | Method and Description |
|---|---|
default PgxFuture<PgxGraph> |
GraphAlterationBuilder.buildAsync()
Create a new graph that is the result of the alteration of the current graph.
|
PgxFuture<PgxGraph> |
GraphAlterationBuilder.buildAsync(java.lang.String newGraphName)
Create a new graph that is the result of the alteration of the current graph.
|
PgxFuture<PgxGraph> |
GraphAlterationBuilder.buildNewSnapshotAsync()
Create a new snapshot for the current graph that is the result of the alteration of the current snapshot.
|
Copyright © 2015 - 2020 Oracle and/or its affiliates. All Rights Reserved.