Design and Implementation of a Middleware for Data Analysis of Social Networks

This thesis deals with the design and implementation of a middleware that constructs network graphs for analysis purposes. We study how relational data can be collected, filtered and finally transformed into graphs - or network data. We introduce a modified version of the breadth-first search algorithm to discover outside nodes connected to subgraphs generated by Proximity, a network filtering tool. The results that were produced show that network data based on relational data can be created and that interesting social network graphs can be generated using different search strategies with defined predicates.