public interface OraclePropertyGraphAnalytics
Modifier and Type | Method and Description |
---|---|
void |
collaborativeFiltering(java.lang.String szEdgeTabName, java.lang.String szLabel, java.lang.String szRatingProperty, int iterations, double minError, int features, double learningRate, double decreaseRate, double regularizationParam, int dop, java.lang.StringBuilder sbLeft, java.lang.StringBuilder sbRight, java.lang.StringBuilder sbLeft1, java.lang.StringBuilder sbRight1, java.lang.StringBuilder sbMatrixProduct, java.lang.StringBuilder sbLeftDelta, java.lang.StringBuilder sbRightDelta, java.lang.String szTBS, java.lang.String szOptions)
This method performs collaborative filtering using matrix factorization on the graph.
|
void |
collaborativeFilteringCleanup(java.lang.String szEdgeTabName, java.lang.StringBuilder sbLeft, java.lang.StringBuilder sbRight, java.lang.StringBuilder sbLeft1, java.lang.StringBuilder sbRight1, java.lang.StringBuilder sbMatrixProduct, java.lang.StringBuilder sbLeftDelta, java.lang.StringBuilder sbRightDelta, java.lang.String szOptions)
This method does cleanup work after running graph collaborative filtering.
|
void |
collaborativeFilteringPrep(java.lang.String szEdgeTabName, java.lang.StringBuilder sbLeft, java.lang.StringBuilder sbRight, java.lang.StringBuilder sbLeft1, java.lang.StringBuilder sbRight1, java.lang.StringBuilder sbMatrixProduct, java.lang.StringBuilder sbLeftDelta, java.lang.StringBuilder sbRightDelta, java.lang.String szOptions)
This method does preparation work before running the collaborative filtering on the graph.
|
long |
countTriangle(java.lang.StringBuilder sbUndirWorkTab)
This method returns the number of triangles that exist in this graph which is treated as undirected.
|
long |
countTriangle(java.lang.StringBuilder sbUndirWorkTab, int iNumSubPtns, int iDOP, java.lang.String szTBS, java.lang.String szOptions)
This method returns the number of triangles that exist in this graph.
|
void |
countTriangleCleanup(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, java.lang.String szOptions)
This method does cleanup work after running triangle calculations.
|
void |
countTrianglePrep(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, java.lang.String szOptions)
This method does preparation work before running triangle calculations.
|
long |
countTriangleRenum(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, int iNumSubPtns, int iDOP, java.lang.String szTBS, java.lang.String szOptions)
This method returns the number of triangles that exist in this graph (treated as undirected).
|
long |
estimateTriangleRenum(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, int iNumSubPtns, int iChunk, int iDOP, java.lang.String szTBS, java.lang.String szOptions)
This method estimates the number of triangles that exist in this graph (treated as undirected).
|
void |
findCluster(java.lang.StringBuilder sbClusters, java.lang.StringBuilder sbUndir, java.lang.StringBuilder sbCluas, java.lang.StringBuilder sbNewas, java.lang.StringBuilder sbDelta, int iDOP, java.lang.String szTBS, java.lang.String szOptions)
This method finds clusters in this property graph (treated as undirected).
|
void |
findClusterCleanup(java.lang.StringBuilder sbClusters, java.lang.StringBuilder sbUndir, java.lang.StringBuilder sbCluas, java.lang.StringBuilder sbNewas, java.lang.StringBuilder sbDelta, java.lang.String szOptions)
This method does cleanup work after running graph cluster detection.
|
void |
findClusterPrep(java.lang.StringBuilder sbClusters, java.lang.StringBuilder sbUndir, java.lang.StringBuilder sbCluas, java.lang.StringBuilder sbNewas, java.lang.StringBuilder sbDelta, java.lang.String szOptions)
This method does preparation work before running graph cluster detection.
|
long |
pageRank(java.lang.StringBuilder sbNodePR, java.lang.StringBuilder sbNodeNextPR, java.lang.StringBuilder sbEdgeTabDeg, java.lang.StringBuilder sbDelta, float d, int iNumIterations, float convergence, int iDOP, java.lang.String szTBS, java.lang.String szOptions)
This method calculates the page rank values of vertices in this graph.
|
void |
pageRankCleanup(java.lang.StringBuilder sbNodePR, java.lang.StringBuilder sbNodeNextPR, java.lang.StringBuilder sbEdgeTabDeg, java.lang.StringBuilder sbDelta, java.lang.String szOptions)
This method does cleanup work before running page rank calculation.
|
void |
pageRankPrep(java.lang.StringBuilder sbNodePR, java.lang.StringBuilder sbNodeNextPR, java.lang.StringBuilder sbEdgeTabDeg, java.lang.StringBuilder sbDelta, java.lang.String szOptions)
This method does preparation work before running page rank calculation.
|
java.lang.String |
shortestPath(java.lang.Long lStart, java.lang.Long lEnd, java.lang.StringBuilder sbExpTab)
This method returns a shortest path in a string format.
|
java.lang.String |
shortestPath(java.lang.Long lStart, java.lang.Long lEnd, java.lang.StringBuilder sbExpTab, java.lang.StringBuilder sbPathWeights, java.lang.String szOptions)
This method returns a shortest path in a string format.
|
java.lang.String |
shortestPath(java.lang.Long lStart, java.lang.Long lEnd, java.lang.StringBuilder sbExpTab, java.lang.String szEdgeTabName, java.lang.StringBuilder sbPathWeights, java.lang.String szOptions, java.lang.Long lSCN)
This method returns a shortest path in a string format.
|
java.lang.String |
shortestPath(OracleVertex vStart, OracleVertex vEnd, java.lang.StringBuilder sbExpTab)
This method returns a shortest path in a string format.
|
java.lang.String |
shortestPath(OracleVertex vStart, OracleVertex vEnd, java.lang.StringBuilder sbExpTab, java.lang.StringBuilder sbPathWeights, java.lang.String szOptions)
This method returns a shortest path in a string format.
|
void |
shortestPathCleanup(java.lang.StringBuilder sbExpTab, java.lang.String szOptions)
This method does clean up after running shortest path calculations.
|
void |
shortestPathPrep(java.lang.StringBuilder sbExpTab, java.lang.String szOptions)
This method does some preparation work before running one or multiple shortest path calculations.
|
void collaborativeFiltering(java.lang.String szEdgeTabName, java.lang.String szLabel, java.lang.String szRatingProperty, int iterations, double minError, int features, double learningRate, double decreaseRate, double regularizationParam, int dop, java.lang.StringBuilder sbLeft, java.lang.StringBuilder sbRight, java.lang.StringBuilder sbLeft1, java.lang.StringBuilder sbRight1, java.lang.StringBuilder sbMatrixProduct, java.lang.StringBuilder sbLeftDelta, java.lang.StringBuilder sbRightDelta, java.lang.String szTBS, java.lang.String szOptions) throws java.sql.SQLException
szEdgeTabName
- a String with the name of the graph edges table.szLabel
- the label of the edges that hold the rating property.szRatingProperty
- the name of the rating property.iterations
- the maximum number of iterations.minError
- the minimum error to reach to finish the iterations.features
- the number of features for the left and right side products.learningRate
- the learning rate for the gradient descent.decreaseRate
- the decrease rate if the learning rate is too big for the intermediate error.regularizationParam
- an additional parameter to avoid over fitting.dop
- degree of paralellism.sbLeft
- a place holder for the name of the working table that holds the left side factor of the matrix factorization.sbRight
- a place holder for the name of the working table that holds the right side factor of the matrix factorization.sbLeft1
- a place holder for the name of the working table that holds the left side intermediate step in the gradient descent.sbRight1
- a place holder for the name of the working table that holds the right side intermediate step in the gradient descent.sbMatrixProduct
- a place holder for the name of the working table that holds intermediate matrix product.sbLeftDelta
- a place holder for the name of the working table that holds intermediate left side delta in gradient descent.sbRightDelta
- a place holder for the name of the working table that holds intermediate right side delta in gradient descent.szTBS
- the name of the tablespace. It can be null.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void collaborativeFilteringCleanup(java.lang.String szEdgeTabName, java.lang.StringBuilder sbLeft, java.lang.StringBuilder sbRight, java.lang.StringBuilder sbLeft1, java.lang.StringBuilder sbRight1, java.lang.StringBuilder sbMatrixProduct, java.lang.StringBuilder sbLeftDelta, java.lang.StringBuilder sbRightDelta, java.lang.String szOptions) throws java.sql.SQLException
szEdgeTabName
- a String with the name of the graph edges tablesbLeft
- a place holder for the name of the working table that holds the left side factor of the matrix factorizationsbRight
- a place holder for the name of the working table that holds the right side factor of the matrix factorizationsbLeft1
- a place holder for the name of the working table that holds the left side intermediate step in the gradient descentsbRight1
- a place holder for the name of the working table that holds the right side intermediate step in the gradient descentsbMatrixProduct
- a place holder for the name of the working table that holds intermediate matrix productsbLeftDelta
- a place holder for the name of the working table that holds intermediate left side delta in gradient descentsbRightDelta
- a place holder for the name of the working table that holds intermediate right side delta in gradient descentszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void collaborativeFilteringPrep(java.lang.String szEdgeTabName, java.lang.StringBuilder sbLeft, java.lang.StringBuilder sbRight, java.lang.StringBuilder sbLeft1, java.lang.StringBuilder sbRight1, java.lang.StringBuilder sbMatrixProduct, java.lang.StringBuilder sbLeftDelta, java.lang.StringBuilder sbRightDelta, java.lang.String szOptions) throws java.sql.SQLException
szEdgeTabName
- a String with the name of the graph edges tablesbLeft
- a place holder for the name of the working table that holds the left side factor of the matrix factorizationsbRight
- a place holder for the name of the working table that holds the right side factor of the matrix factorizationsbLeft1
- a place holder for the name of the working table that holds the left side intermediate step in the gradient descentsbRight1
- a place holder for the name of the working table that holds the right side intermediate step in the gradient descentsbMatrixProduct
- a place holder for the name of the working table that holds intermediate matrix productsbLeftDelta
- a place holder for the name of the working table that holds intermediate left side delta in gradient descentsbRightDelta
- a place holder for the name of the working table that holds intermediate right side delta in gradient descentszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
long countTriangle(java.lang.StringBuilder sbUndirWorkTab) throws java.sql.SQLException
sbUndirWorkTab
- a place holder for the name of the undirected working table to be used for calculating triangles.java.sql.SQLException
long countTriangle(java.lang.StringBuilder sbUndirWorkTab, int iNumSubPtns, int iDOP, java.lang.String szTBS, java.lang.String szOptions) throws java.sql.SQLException
sbUndirWorkTab
- a place holder for the name of the undirected working table to be used for calculating triangles. This argument is relevant when "CREATE_UNDIRECTED=T" option is set.iNumSubPtns
- has to be a positive integer and has to be power of two. This value represents the number of logical partitions chosen to do the calculation. Set the value to 1 to avoid using partitioned approach.iDOP
- degree of parallelism to be usedszTBS
- tablespace. It can be NULL.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void countTriangleCleanup(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, java.lang.String szOptions) throws java.sql.SQLException
sbUndirBMTab
- a place holder for the name of the undirected working table (before mapping) to be used for calculating triangles.sbMapWorkTab
- a place holder for the name of the map working table to be used for calculating triangles.sbUndirAMTab
- a place holder for the name of the undirected working table (after mapping) to be used for calculating triangles.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void countTrianglePrep(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, java.lang.String szOptions) throws java.sql.SQLException
sbUndirBMTab
- a place holder for the name of the undirected working table (before mapping) to be used for calculating triangles.sbMapWorkTab
- a place holder for the name of the map working table to be used for calculating triangles. The map working table is for renumbering vertices.sbUndirAMTab
- a place holder for the name of the undirected working table (after mapping) to be used for calculating triangles.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
long countTriangleRenum(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, int iNumSubPtns, int iDOP, java.lang.String szTBS, java.lang.String szOptions) throws java.sql.SQLException
sbUndirBMTab
- a place holder for the name of the undirected working table (before mapping) to be used for calculating triangles.sbMapWorkTab
- a place holder for the name of the map working table to be used for calculating triangles.sbUndirAMTab
- a place holder for the name of the undirected working table (after mapping) to be used for calculating triangles.iNumSubPtns
- has to be a positive integer and has to be power of two. This value represents the number of logical partitions chosen to do the calculation. Set the value to 1 to avoid using partitioned approach.iDOP
- degree of parallelism to be used for creating a working table holding undirected graph data and for executing triangle counting query.szTBS
- tablespace. It can be NULL.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
long estimateTriangleRenum(java.lang.StringBuilder sbUndirBMTab, java.lang.StringBuilder sbMapWorkTab, java.lang.StringBuilder sbUndirAMTab, int iNumSubPtns, int iChunk, int iDOP, java.lang.String szTBS, java.lang.String szOptions) throws java.sql.SQLException
sbUndirBMTab
- a place holder for the name of the undirected working table (before mapping) to be used for calculating triangles.sbMapWorkTab
- a place holder for the name of the map working table to be used for calculating triangles.sbUndirAMTab
- a place holder for the name of the undirected working table (after mapping) to be used for calculating triangles.iNumSubPtns
- has to be a positive integer and has to be power of two. This value represents the number of logical partitions chosen to do the calculation. As the number of logical partitions grows, the estimation will become faster (and less precise).iChunk
- an integer in the range of [0, iNumSubPtns*iNumSubPtns - 1]iDOP
- degree of parallelism to be usedszTBS
- tablespace. It can be NULL.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void findCluster(java.lang.StringBuilder sbClusters, java.lang.StringBuilder sbUndir, java.lang.StringBuilder sbCluas, java.lang.StringBuilder sbNewas, java.lang.StringBuilder sbDelta, int iDOP, java.lang.String szTBS, java.lang.String szOptions) throws java.sql.SQLException
sbClusters
- a place holder for the name of the output table that holds cluster assignment for verticessbUndir
- a place holder for the name of the working table that holds undirected graphsbCluas
- a place holder for the name of the working table that holds intermediate cluster assignmentsbNewas
- a place holder for the name of the working table that holds updated cluster assignmentsbDelta
- a place holder for the name of the working table that holds delta informationszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void findClusterCleanup(java.lang.StringBuilder sbClusters, java.lang.StringBuilder sbUndir, java.lang.StringBuilder sbCluas, java.lang.StringBuilder sbNewas, java.lang.StringBuilder sbDelta, java.lang.String szOptions) throws java.sql.SQLException
sbClusters
- a place holder for the name of the output table that holds cluster assignment for verticessbUndir
- a place holder for the name of the working table that holds undirected graphsbCluas
- a place holder for the name of the working table that holds intermediate cluster assignmentsbNewas
- a place holder for the name of the working table that holds updated cluster assignmentsbDelta
- a place holder for the name of the working table that holds delta informationszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void findClusterPrep(java.lang.StringBuilder sbClusters, java.lang.StringBuilder sbUndir, java.lang.StringBuilder sbCluas, java.lang.StringBuilder sbNewas, java.lang.StringBuilder sbDelta, java.lang.String szOptions) throws java.sql.SQLException
sbClusters
- a place holder for the name of the output table that holds cluster assignment for verticessbUndir
- a place holder for the name of the working table that holds undirected graphsbCluas
- a place holder for the name of the working table that holds intermediate cluster assignmentsbNewas
- a place holder for the name of the working table that holds updated cluster assignmentsbDelta
- a place holder for the name of the working table that holds delta informationszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
long pageRank(java.lang.StringBuilder sbNodePR, java.lang.StringBuilder sbNodeNextPR, java.lang.StringBuilder sbEdgeTabDeg, java.lang.StringBuilder sbDelta, float d, int iNumIterations, float convergence, int iDOP, java.lang.String szTBS, java.lang.String szOptions) throws java.sql.SQLException
sbNodePR
- a place holder for the name of the working table that holds the page rank values of the verticessbNodeNextPR
- a place holder for the name of the working table that holds the page rank values in the next iterationsbEdgeTabDeg
- a place holder for the name of the working table that holds edges and node degree informationsbDelta
- a place holder for the name of the working table that holds information about some special verticesd
- damping factor, 0.85f is often used.iNumIterations
- number of iterations to perform PR calculations.convergence
- if positive, then continue PR calculations till sum of PR value changes is less than this convergence setting.iDOP
- degree of parallelism to be used for creating a working table holding undirected graph data and for executing triangle counting query.szTBS
- tablespace. It can be NULL.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void pageRankCleanup(java.lang.StringBuilder sbNodePR, java.lang.StringBuilder sbNodeNextPR, java.lang.StringBuilder sbEdgeTabDeg, java.lang.StringBuilder sbDelta, java.lang.String szOptions) throws java.sql.SQLException
sbNodePR
- a place holder for the name of the working table that holds the page rank values of the verticessbNodeNextPR
- a place holder for the name of the working table that holds the page rank values in the next iterationsbEdgeTabDeg
- a place holder for the name of the working table that holds edges and node degree informationsbDelta
- a place holder for the name of the working table that holds information about some special verticesszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void pageRankPrep(java.lang.StringBuilder sbNodePR, java.lang.StringBuilder sbNodeNextPR, java.lang.StringBuilder sbEdgeTabDeg, java.lang.StringBuilder sbDelta, java.lang.String szOptions) throws java.sql.SQLException
sbNodePR
- a place holder for the name of the working table that holds the page rank values of the verticessbNodeNextPR
- a place holder for the name of the working table that holds the page rank values in the next iterationsbEdgeTabDeg
- a place holder for the name of the working table that holds edges and node degree informationsbDelta
- a place holder for the name of the working table that holds information about some special verticesszOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
java.lang.String shortestPath(java.lang.Long lStart, java.lang.Long lEnd, java.lang.StringBuilder sbExpTab) throws java.sql.SQLException
lStart
- start vertex integer IDlEnd
- destination vertex integer IDsbExpTab
- place holder of expansion table namejava.sql.SQLException
java.lang.String shortestPath(java.lang.Long lStart, java.lang.Long lEnd, java.lang.StringBuilder sbExpTab, java.lang.StringBuilder sbPathWeights, java.lang.String szOptions) throws java.sql.SQLException
lStart
- start vertex integer IDlEnd
- destination vertex integer IDsbExpTab
- place holder of expansion table namesbPathWeights
- place holder of path weights of the shortest path. The first number represents the number of vertices on the shortest path, the second number represents the total weight and the rest numbers denote weights of edges along the shortest path. All these numbers are delimited by spaces.szOptions
- options to be passed on to the underlying PL/SQL API.java.sql.SQLException
java.lang.String shortestPath(java.lang.Long lStart, java.lang.Long lEnd, java.lang.StringBuilder sbExpTab, java.lang.String szEdgeTabName, java.lang.StringBuilder sbPathWeights, java.lang.String szOptions, java.lang.Long lSCN) throws java.sql.SQLException
lStart
- start vertex integer IDlEnd
- destination vertex integer IDszEdgeTabName
- name of the edge table (or view). Note that one can create a view on top of existing edge table to filter out unwanted edges.sbPathWeights
- place holder of path weights of the shortest path. The first number represents the number of vertices on the shortest path, the second number represents the total weight and the rest numbers denote weights of edges along the shortest path. All these numbers are delimited by spaces.szOptions
- options to be passed on to the underlying PL/SQL API.lSCN
- SCN for the edge table. It can be NULL.java.sql.SQLException
java.lang.String shortestPath(OracleVertex vStart, OracleVertex vEnd, java.lang.StringBuilder sbExpTab) throws java.sql.SQLException
vStart
- start vertex objectvEnd
- destination vertex objectsbExpTab
- place holder of expansion table namejava.sql.SQLException
java.lang.String shortestPath(OracleVertex vStart, OracleVertex vEnd, java.lang.StringBuilder sbExpTab, java.lang.StringBuilder sbPathWeights, java.lang.String szOptions) throws java.sql.SQLException
vStart
- start vertex objectvEnd
- destination vertex objectsbExpTab
- place holder of expansion table namesbPathWeights
- place holder of path weights of the shortest path. The first number represents the number of vertices on the shortest path, the second number represents the total weight and the rest numbers denote weights of edges along the shortest path. All these numbers are delimited by spaces.szOptions
- options to be passed on to the underlying PL/SQL API.java.sql.SQLException
void shortestPathCleanup(java.lang.StringBuilder sbExpTab, java.lang.String szOptions) throws java.sql.SQLException
sbExpTab
- a place holder for the name of the expansion table to be used for Bi-directional, Set Style, Dijkstra search.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
void shortestPathPrep(java.lang.StringBuilder sbExpTab, java.lang.String szOptions) throws java.sql.SQLException
sbExpTab
- a place holder for the name of the expansion table to be used for Bi-directional, Set Style, Dijkstra search. If sbExpTab is empty, an intermediate working table will be created and the table name will be returned in the sbExpTab object.szOptions
- options to be used by the underlying PL/SQL API.java.sql.SQLException
Copyright © 2017, 2018 Oracle and/or its affiliates. All Rights Reserved.