This page describes all problems, tasks and solution approaches regarding the data structure to handle invocation data.

Main topics

• What would be the best data structure for handing this kind of data?
• How can the data structure be modified to optimize the data handling?
• How to handle the data in a efficient way?

• How to convert the data from the agent to the storage data structure(relational?) or tree structure?

• How to reconstruct the invocation tree structure from the provided data?

Current solution (state)

One approach, that were already discussed in the master thesis, were to change the data structure from hierarchy based to relation based.
Potential candidates for this is the Adjacency list and Pre-order Traversing.

Currently data is handled in a relational data structure.

New approaches / solution

Coming soon...

Questions / Possible Problems

Coming soon...