Anthony Potter

Learn More
Web-scale RDF datasets are increasingly processed using distributed RDF data stores built on top of a cluster of shared-nothing servers. Such systems critically rely on their data partitioning scheme and query answering scheme, the goal of which is to facilitate correct and efficient query processing. Existing data partitioning schemes are commonly based on(More)
The hydration capacities of a biomimetic polymer, 2-methacryloyloxethylphosphorylcholine polymer (pMPC), alone and microencapsulated, in association with another well known hydrating polymer, Hyaluronic acid, were investigated in vitro on skin models and in vivo on volunteers by using confocal Raman microspectroscopy. The hydration impact and the relative(More)
Evaluating joins over RDF data stored in a shared-nothing server cluster is key to processing truly large RDF datasets. To the best of our knowledge, the existing approaches use a variant of the data exchange operator that is inserted into the query plan statically (i.e., at query compile time) to shuffle data between servers. We argue that such approaches(More)
Foreword The 2014 Department of Computer Science Student Conference was held on the 13th June in the department. This year we had a very decent number of submissions with 19 abstracts and 9 posters submitted. What is particularly encouraging, the 12 abstracts that were accepted represented research from across the departments research themes. The conference(More)
A misleading perception about healthcare security as "the hospital's police force" has separated officers from any meaningful role as caregivers whose primary role is providing a safe environment for patient care. This article describes how one healthcare system developed a holistic public safety program within the context of its stated mission.
Graph querying and pattern matching is becoming an important feature of graph processing as it allows data analysts to easily collect and understand information about their graphs in a way similar to SQL for databases. One of the key challenges in graph pattern matching is to process increasingly large graphs that often do not fit in the memory of a single(More)