Research on High-Performance Graph Differencing, Fuzzy Hashing and Clustering Algorithms

Metafor is developing a new class of IT system management solutions and as a part of this, Metafor wants a method to show differences between multiple deployed instances of an application. Metafor would also like to have the ability to group many application in different clusters based on their structural similarities. We would like to be able to do so by calculating hash values for each tree, or to find an alternative way which is inexpensive in CPU and memory usage. Moreover, we would like to find ways to apply the tree differencing techniques already developed, to models of applications that are unavoidably messy and cyclic, reflecting their often chaotic reality. To implement this, Metafor requires an accurate and high-performance generalized graph differencing algorithm. All the implementations will be done using the Java and Scala programming languages.

Faculty Supervisor:

Will Evans

Student:

Partner:

Metafor Software

Discipline:

Computer science

Sector:

Information and cultural industries; Professional, scientific and technical services

University:

The University of British Columbia

Program: