A.11.55 OPG_APIS.SPARSIFY_GRAPH_PREP
Format
OPG_APIS.SPARSIFY_GRAPH_PREP( edge_tab_name IN VARCHAR2, wt_out_tab IN OUT VARCHAR2, wt_und_tab IN OUT VARCHAR2, wt_hsh_tab IN OUT VARCHAR2, wt_mch_tab IN OUT VARCHAR2, options IN VARCHAR2 DEFAULT NULL);
Description
Prepares working table names that are necessary to run sparsification for a property graph edge table.
Parameters
- edge_tab_name
-
Name of the property graph edge table (GE$).
- wt_out_tab
-
A working table to hold the output, a sparsified graph.
- wt_und_tab
-
A working table to hold the undirected version of the original graph.
- wt_hsh_tab
-
A working table to hold the min hash values of the graph.
- wt_mch_tab
-
A working table to hold the matching count of min hash values.
- options
-
Additional settings for operation. An optional string with one or more (comma-separated) of the following values:
-
'INMEMORY=T' is an option for creating the schema tables with an 'inmemory' clause.
-
'IMC_MC_B=T' creates the schema tables with an INMEMORY MEMCOMPRESS BASIC clause.
-
Usage Notes
The sparsification algorithm used is a min hash based local sparsification. See "Local graph sparsification for scalable clustering", Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data: https://cs.uwaterloo.ca/~tozsu/courses/CS848/W15/presentations/ElbagouryPresentation-2.pdf
Examples
The following example does the preparation work for the edges table of mypg
and prints out the working table names.
set serveroutput on DECLARE my_lean_pg varchar2(100) := 'lean_pg'; wt2 varchar2(100); wt3 varchar2(100); wt4 varchar2(100); BEGIN opg_apis.sparsify_graph_prep('mypgGE$', my_lean_pg, wt2, wt3, wt4, null); dbms_output.put_line('wt2 ' || wt2 || ', wt3 ' || wt3 || ', wt4 '|| wt4); END; /
The output may be similar to the following.
wt2 "MYPGGE$$TWSPAU275", wt3 "MYPGGE$$TWSPAH275", wt4 "MYPGGE$$TWSPAM275"
Parent topic: OPG_APIS Package Subprograms