Graph-Based Caching for Server-Push Enabled Adaptive Hypertext Applications

Thommes, Daniel, Gerlicher, Ansgar, Wang, Qi and Grecos, Christos (2015) Graph-Based Caching for Server-Push Enabled Adaptive Hypertext Applications. In: 2015 IEEE 18th International Conference on Computational Science and Engineering. IEEE, pp. 224-232. ISBN 9781467382977

Full text not available from this repository.

Abstract

The inherent structure of applications defined with hypertext markup languages is that of a graph. Push-enabled protocols like HTTP/2 drive the need for solutions allowing the server to traverse this graph and preemptively push related resources to the client. In addition to this, user interface adaptation to various mobile devices belongs to the server's tasks. Taking into account the diversities in client hardware, software and user preferences we designed a solution to reuse once adapted resources for similar configurations. In this paper we propose a new caching architecture for these purposes that is based on the application of graph database systems. With different approaches we show how to increase their performance when used as resource caches. In our evaluation the proposed implementation reduced the amount of adapted resources by 89%. In a real-world scenario it achieved twice the throughput of a traditional implementation and used 40% less heap memory.

Item Type:	Book Section
Subjects:	Q Science > QA Mathematics > Electronic computers. Computer science T Technology > T Technology (General) > Information Technology > Electronic computers. Computer science Q Science > QA Mathematics > Computer software T Technology > T Technology (General) > Information Technology > Computer software
Divisions:	School of Computing > Staff Research and Publications
Depositing User:	Caoimhe Ní Mhaicín
Date Deposited:	28 Feb 2019 18:18
Last Modified:	28 Feb 2019 18:18
URI:	https://norma.ncirl.ie/id/eprint/3621

Actions (login required)

View Item