Praveen Hiremath
Praveen Hiremath
The correlation coefficient for the edge between the two tables, calculated based on the relationship attributes and weights
The Application generates the logs the as and when the user access it. We have something called SQL Tuning sets which actually captures the workload generated by the application on...
Transform the smaller communities which are formed into microservices schemas.
- The Louvain algorithm takes the input graphs and identities strong connectivity within graphs and forms a smaller communities. - Here decomposes the monolith database schema(graph) into modular microservice schemas(sub-graphs)....
- Define the nodes which are always to be together. The nodes should be part of same community. - Move the node from one community to another community.
Construct the Oracle graph for the input dat with Tables and affinity(edge weights) between the tables.
Generation of clusters from the schema having list of DB tables. Iterate with more clustering by adding constraints. Work on the Cerner Data to form the clusters. Create the Advisory...