Uses of Annotation Interface
com.ocient.util.SuppressFBWarnings

Packages that use SuppressFBWarnings

Package	Description
com.ocient.jdbc.graph
com.ocient.util

Uses of SuppressFBWarnings in com.ocient.jdbc.graph

Methods in com.ocient.jdbc.graph with annotations of type SuppressFBWarnings

Modifier and Type	Method	Description
static void	OCGraph.aggregateMessages(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, String sendToSourceExpr, String sendToDestExpr, String aggregateExpr, ArrayList<String> resultVerticesIndexes, Statement stmt)	Aggregates messages passed between connected vertices in a graph and stores the results in a new table.
static void	OCGraph.collectEdges(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, OCGraph.EdgeDirection direction, ArrayList<String> resultVerticesIndexes, Statement stmt)	Collects edge information associated with each vertex in a graph stored in database tables and stores the results in a new table.
static void	OCGraph.collectNeighbors(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, OCGraph.EdgeDirection direction, ArrayList<String> resultVerticesIndexes, Statement stmt)	Collects neighbor information for each vertex in a graph stored in database tables and stores the results in a new table.
static void	OCGraph.createTripletsTable(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTripletsTable, ArrayList<String> resultTripletsIndexes, Statement stmt)	Creates a materialized triplet table by joining vertex and edge data from input tables.
static void	OCGraph.createTripletsView(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTripletsView, Statement stmt)	Creates a database view representing graph triplets (source vertex, edge, destination vertex).
static void	OCGraph.degrees(String inputSchema, String inputEdgesTable, String resultSchema, String resultDegreesTable, ArrayList<String> resultIndexes, Statement stmt)	Calculates the total degree (combined in-degree and out-degree) for each node in a graph represented by an edges table and stores the results in a new table.
static void	OCGraph.fromEdges(String inputSchema, String inputEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultColumnExpressions, ArrayList<String> resultVerticesIndexes, Statement stmt)	Creates a vertices table from an existing edges table by extracting unique source and destination IDs.
static void	OCGraph.groupEdges(String inputSchema, String inputEdgesTable, String resultSchema, String resultEdgesTable, ArrayList<String> resultColumnExpressions, ArrayList<String> resultEdgesIndexes, Statement stmt)	Groups duplicate edges from an input table into a new result table using SQL aggregation.
static void	OCGraph.inDegrees(String inputSchema, String inputEdgesTable, String resultSchema, String resultInDegreesTable, ArrayList<String> resultIndexes, Statement stmt)	Calculates the in-degree for each destination node in a given edge table and stores the results (node ID and its in-degree count) in a newly created table.
static void	OCGraph.joinVertices(String inputSchema, String inputVerticesTable, String modificationSchema, String modificationVerticesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultAttributeExpressions, ArrayList<String> resultVerticesIndexes, Statement stmt)	Joins two sets of vertices (input and modification) into a result table.
static void	OCGraph.labelPropagation(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, int maxIterations, ArrayList<String> resultVerticesIndexes, Statement stmt)	Performs the Label Propagation Algorithm (LPA) iteratively on graph data stored in database tables, assigning community labels to vertices.
static void	OCGraph.mapTriplets(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultEdgesTable, ArrayList<String> resultColumnExpressions, ArrayList<String> resultEdgesIndexes, Statement stmt)	Transforms edge attributes by incorporating information from the source and destination vertices (the "triplet").
static void	OCGraph.outDegrees(String inputSchema, String inputEdgesTable, String resultSchema, String resultOutDegreesTable, ArrayList<String> resultIndexes, Statement stmt)	Calculates the out-degree for each node in a graph represented by an edge table and stores the results in a new database table.
static void	OCGraph.pregel(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, String initializerExpr, String sendToSourceExpr, String sendToDestExpr, String aggregateExpr, String updaterExpr, int maxIterations, ArrayList<String> resultVerticesIndexes, Statement stmt)	Performs a Pregel-like graph computation using SQL.
static void	OCGraph.reverseEdges(String inputSchema, String inputEdgesTable, String resultSchema, String resultEdgesTable, ArrayList<String> resultEdgesIndexes, Statement stmt)	Reverses the direction of edges stored in a database table.
static void	OCGraph.TriangleCount.runPreCanonicalized(String inputSchema, String inputVerticesTable, String canonicalEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultVerticesIndexes, Statement stmt)	Runs triangle count on a graph where the input vertices and canonical edges reside in the same schema, and the edges are already canonicalized (srcid invalid input: '<' destid, no duplicates or self-loops).
static void	OCGraph.shortestPaths(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultTable, List<Long> landmarks, String edgeWeightColumn, int maxIterations, ArrayList<String> resultIndexes, Statement stmt)	Computes the shortest paths from all vertices in the graph to a specified set of landmark vertices.
static void	OCGraph.stronglyConnectedComponents(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, ArrayList<String> resultVerticesIndexes, Statement stmt)	Computes the Strongly Connected Components (SCCs) of a directed graph represented by vertex and edge tables in a database.
static void	OCGraph.subgraph(String inputSchema, String inputVerticesTable, String inputEdgesTable, String resultSchema, String resultVerticesTable, String resultEdgesTable, String vertexFilter, String edgeFilter, ArrayList<String> resultVerticesIndexes, ArrayList<String> resultEdgesIndexes, Statement stmt)	Creates a subgraph consisting of new vertex and edge tables based on filtering criteria applied to existing input graph tables.

Uses of SuppressFBWarnings in com.ocient.util

Methods in com.ocient.util with annotations of type SuppressFBWarnings

Modifier and Type	Method	Description
static <E extends Exception> E	CompletableFutures.marshalThrowable(Throwable e, Class<? extends E> clazz, Function<Throwable,E> f)	Marshals a given Throwable into an E.