News articles generated by artificial intelligence rather than human reporters are referred to as automated journalism. This thesis explores how to create a trustworthy representation of news articles that mainly are generated by algorithmic decisions. The hypothesis of this thesis takes the background (characteristics of the underlying system design) and the foreground (millennials news consumption behaviour) contexts into consideration in order to provide an optimal approach for trustworthy representation of auto-generated articles. A theory about algorithmic transparency in the news media has been investigated to reveal information about the systems selection processes. The principles of glanceability and the heuristic principles are applied to proposed design solutions (interactive features). The outcomes show that newsreaders are positive towards a system that is trying to encourage them to fact-check the articles. Additionally, the outcomes also contributed to the understanding of how newsreaders can consume auto-generated news.

As databases and traffic over the internet is becoming larger by the day, the performance of sending information has become a target of great importance. In past years, other software architectural styles such as REST have been used as it is a reliable framework and works really well when one has a dependable internet connection. In 2015, the querying language GraphQL was released by Facebook to the public as an alternative to REST. GraphQL made improvements in fetching data by for example removing the possibility of under- and overfitting. This means that a client only gets the data which they have requested, nothing more, nothing less. To create a GraphQL schema and server implementation requires time, effort and knowledge. This is however a requirement to run GraphQL over your current legacy database. For this reason multiple server implementation tools have been created by vendors to reduce development time and instead auto-generates a GraphQL schema and server implementation using an already existing database. This bachelor thesis will pick, run and compare the benchmarks of the two different server implementation tools Hasura and PostGraphile. This is done using a benchmark methodology based on technical difficulties (choke points). The result of our benchmark suggests that the throughput is larger for Hasura compared to PostGraphile whilst the query execution time as well as query response time is similar. PostGraphile is better at paging without offset as well as ordering, but on all other cases Hasura outperforms PostGraphile or shows similar results. / Linköping GraphQL Benchmark (LinGBM)