<?xml version="1.0" encoding="ISO-8859-1"?>
<?xml-stylesheet type="text/xsl" href="publications.xsl"?>
<publications> 
<update>23 September 2011</update>

<journal>
  <title>A Semantic Sensor Web for Environmental Decision Support Applications</title>
  <year>2011</year>
	<authors>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Jason Sadler</name><notLast/></author>
		<author><name>Oles Kit</name><notLast/></author>
		<author><name>Kostis Kyzirakos</name><notLast/></author>
		<author><name>Manos Karpathiotakis</name><notLast/></author>
		<author><name>Jean-Paul Calbimonte</name><notLast/></author>
		<author><name>Kevin Page</name><notLast/></author>
		<author><name>Raul Garcia-Castro</name><notLast/></author>
		<author><name>Alex Frazer</name><notLast/></author>
		<author><name>Ixent Galpin</name><notLast/></author>
		<author><name>Alvaro A. A. Fernandes</name><notLast/></author>
		<author><name>Norman W. Paton</name><notLast/></author>
		<author><name>Oscar Corcho</name><notLast/></author>
		<author><name>Manolis Koubarakis</name><notLast/></author>
		<author><name>David De Roure</name><notLast/></author>
		<author><name>Kirk Marinez</name><notLast/></author>
		<author><name>Asuncion Gomez-Perez</name></author>
	</authors>
  <url>http://www.mdpi.com/1424-8220/11/9/8855/</url>
  <booktitle>Sensors</booktitle>
  <volume>11(9)</volume>
  <pages>8855-8887</pages>
  <abstract>
  	<id>sensors2011</id>
  	<para>Sensing devices are increasingly being deployed to monitor the physical world around us. One class of application for which sensor data is pertinent is environmental decision support systems, e.g., flood emergency response. For these applications, the sensor readings need to be put in context by integrating them with other sources of data about the surrounding environment. Traditional systems for predicting and detecting floods rely on methods that need significant human resources. In this paper we describe a semantic sensor web architecture for integrating multiple heterogeneous datasets, including live and historic sensor data, databases, and map layers. The architecture provides mechanisms for discovering datasets, defining integrated views over them, continuously receiving data in real-time, and visualising on screen and interacting with the data. Our approach makes extensive use of web service standards for querying and accessing data, and semantic technologies to discover and integrate datasets. We demonstrate the use of our semantic sensor web architecture in the context of a flood response planning web application that uses data from sensor networks monitoring the sea-state around the coast of England.
  	</para>
  </abstract>
</journal>

<conference>
	<title>Executing in-network queries using SNEE (Demo)</title>
	<authors>
		<author><name>Ixent Galpin</name><notLast/></author>
		<author><name>Robert Taylor</name><notLast/></author>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Christian C. Y. Brenninkmeijer</name><notLast/></author>
		<author><name>Alvaro A. A. Fernandes</name><notLast/></author>
		<author><name>Norman W. Paton</name></author>
	</authors>
	<month>July</month>
	<year>2011</year>
	<location>Manchester, UK</location>
<!--	<url>eswc2011.pdf</url>
	<pages>300-314</pages>-->
	<booktitle>proceedings 28th British National Conference on Databases (BNCOD 2011)</booktitle>
<!--	<abstract>
		<id>bncod2011</id>
		<para>
		</para>
	</abstract>-->
</conference>

<conference>
	<title>Deploying in-network data analysis techniques in sensor networks (Demo)</title>
	<authors>
		<author><name>George Valkanas</name><notLast/></author>
		<author><name>Alexis Kotsifakos</name><notLast/></author>
		<author><name>Dimitrios Gunopulos</name><notLast/></author>
		<author><name>Ixent Galpin</name><notLast/></author>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Alvaro A. A. Fernandes</name><notLast/></author>
		<author><name>Norman W. Paton</name></author>
	</authors>
	<month>June</month>
	<year>2011</year>
	<location>Lulea, Sweeden</location>
<!--	<url>mdm2011.pdf</url>
	<pages></pages> -->
	<booktitle>proceedings 12th International Conference on Mobile Data Management (MDM 2011)</booktitle>
<!--	<abstract>
		<id>mdm2011</id>
		<para>
		</para>
	</abstract>-->
</conference>

<conference>
	<title>A Semantically Enabled Service Architecture for Mashups over Streaming and Stored Data</title>
	<authors>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Raul Garcia-Castro</name><notLast/></author>
		<author><name>Kostis Kyzirakos</name><notLast/></author>
		<author><name>Manos Karpathiotakis</name><notLast/></author>
		<author><name>Jean-Paul Calbimonte</name><notLast/></author>
		<author><name>Kevin Page</name><notLast/></author>
		<author><name>Jason Sadler</name><notLast/></author>
		<author><name>Alex Frazer</name><notLast/></author>
		<author><name>Ixent Galpin</name><notLast/></author>
		<author><name>Alvaro A. A. Fernandes</name><notLast/></author>
		<author><name>Norman W. Paton</name><notLast/></author>
		<author><name>Oscar Corcho</name><notLast/></author>
		<author><name>Manolis Koubarakis</name><notLast/></author>
		<author><name>David De Roure</name><notLast/></author>
		<author><name>Kirk Marinez</name><notLast/></author>
		<author><name>Asuncion Gomez-Perez</name></author>
	</authors>
	<month>June</month>
	<year>2011</year>
	<location>Heraklion (Crete, Greece)</location>
	<url>http://dx.doi.org/10.1007/978-3-642-21064-8_21</url>
	<pages>300-314</pages>
	<booktitle>proceedings 8th Extended Semantic Web Conference (ESWC 2011)</booktitle>
	<presentation>Publications/eswc2011Presentation.pptx</presentation>
	<abstract>
		<id>eswc2011</id>
		<para>
Sensing devices are increasingly being deployed to monitor the physical world around us. One class of application for which sensor data is pertinent is environmental decision support systems, e.g. flood emergency response. However, in order to interpret the readings from the sensors, the data needs to be put in context through correlation with other sensor readings, sensor data histories, and stored data, as well as juxtaposing with maps and forecast models. In this paper we use a flood emergency response planning application to identify requirements for a semantic sensor web. We propose a generic service architecture to satisfy the requirements that uses semantic annotations to support well-informed interactions between the services. We present the SemSorGrid4Env realisation of the architecture and illustrate its capabilities in the context of the example application.
		</para>
	</abstract>
</conference>

<conference>
	<title>Building Semantic Sensor Webs and Applications (Tutorial)</title>
	<authors>
		<author><name>Oscar Corcho</name><notLast/></author>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Kostis Kyzirakos</name><notLast/></author>
		<author><name>Jean-Paul Calbimonte</name><notLast/></author>
		<author><name>Kevin Page</name><notLast/></author>
	</authors>
	<month>June</month>
	<year>2011</year>
	<location>Heraklion (Crete, Greece)</location>
	<url>http://semsorgrid4env.eu/index.php/events-meetings/49-building-semantic-sensor-webs-and-applications-eswc-2011</url>
	<booktitle>proceedings 8th Extended Semantic Web Conference (ESWC 2011)</booktitle>
	<abstract>
		<id>eswctutorial2011</id>
		<para>
The term Semantic Sensor Web has recently been used to refer to the combination of sensor network, Web and semantic technologies with the view of addressing the opportunity that we have to unify the real and the virtual world. Sensor networks promise to bridge the gap that, for too long, has separated computing applications from the physical world that they model and in which they are ultimately embedded.
		</para>
		<para>
Many scientific and technological challenges need to be tackled before sensor networks can be exploited to their full capacity. Additionally, as more and more sensor networks are independently developed and deployed, it becomes increasingly important to support their reuse in applications that were not foreseen or that transcend their original purpose. This will facilitate the use of sensor web technology to support decision-making that requires on-the-fly integration of data of differing modalities, e.g. sensed data with data stored in databases, as well as the ad hoc generation of mashups over data stemming from computations that combine real-time and legacy historical data. This, in turn, will enable the enacting of decisions based on such real-time sensed data.
		</para>
		<para>
This tutorial aims at presenting the components that comprise a semantic sensor web and the mechanisms to exploit these in creating an application. The tutorial targets researchers and practitioners interested in working with semantic sensor web technologies.		</para>
	</abstract>
</conference>

<seminar>
  <title>Data Integration on the Semantic Sensor Web</title>
  <month>April</month>
  <year>2011</year>
  <url>Publications/iclSeminar2011.pptx</url>
  <occasion>Seminar talk given to the Large-Scale Distributed Systems Research Group at Imperial College London</occasion>
  <abstract>
    <id>iclSeminar2011</id>
    <para>
The availability of streaming data sources is progressively increasing thanks to the development of ubiquitous data capturing technologies such as sensor networks, which are increasingly being deployed to monitor the physical world around us. One class of application for which sensor data is pertinent is environmental decision support systems, e.g. flood emergency response. For these applications, the sensor readings need to be put in context by integrating them with other sources of data about the surrounding environment.
    </para>
    <para>
In this talk we describe a semantic sensor web architecture that enables the integration of multiple heterogeneous datasets, including live and historic sensor data, databases, and map layers. The architecture provides mechanisms for discovering datasets, defining integrated views over them, and visualising on screen and interacting with the data. The heterogeneity of the data sources introduces the requirement of providing data access in a unified and coherent manner, whilst allowing the user to express their needs at an ontological level. We shall present the mechanisms by which we support ontology-based streaming data integration. Finally, we will demonstrate the use of our semantic sensor web architecture and data integration approach in the context of a flood response planning web application that uses data from sensor networks monitoring the sea-state around the coast of England.
    </para>
  </abstract>
</seminar>

<journal>
  <title>SNEE: A query processor for wireless sensor networks</title>
  <year>2011</year>
  <authors>
    <author><name>Ixent Galpin</name><notLast/></author>
    <author><name>Christian Y A Brenninkmeijer</name><notLast/></author>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Farhana Jabeen</name><notLast/></author>
    <author><name>Alvaro A A Fernandes</name><notLast/></author>
    <author><name>Norman W Paton</name></author>
  </authors>
  <url>http://www.springerlink.com/content/2314991240243387/</url>
  <booktitle>Distributed and Parallel Databases</booktitle>
  <volume>29(1-2)</volume>
  <pages>31-85</pages>
  <abstract>
  	<id>dpdb2011</id>
  	<para>
A wireless sensor network (WSN) can be construed as an intelligent, large-scale device for observing and measuring properties of the physical world. In recent years, the database research community has championed the view that if we construe a WSN as a database (i.e., if a significant aspect of its intelligent behavior is that it can execute declaratively-expressed queries), then one can achieve a significant reduction in the cost of engineering the software that implements a data collection program for the WSN while still achieving, through query optimization, very favorable cost:benefit ratios. This paper describes a query processing framework for WSNs that meets many desiderata associated with the view of WSN as databases. The framework is presented in the form of compiler/optimizer, called SNEE, for a continuous declarative query language over sensed data streams, called SNEEql. SNEEql can be shown to meet the expressiveness requirements of a large class of applications. SNEE can be shown to generate effective and efficient query evaluation plans. More specifically, the paper describes the following contributions: (1) a user-level syntax and physical algebra for SNEEql, an expressive continuous query language over WSNs; (2) example concrete algorithms for physical algebraic operators defined in such a way that the task of deriving memory, time and energy analytical cost-estimation models (CEMs) for them becomes straightforward by reduction to a structural traversal of the pseudocode; (3) CEMs for the concrete algorithms alluded to; (4) an architecture for the optimization of SNEEql queries, called SNEE, building on well-established distributed query processing components where possible, but making enhancements or refinements where necessary to accommodate the WSN context; (5) algorithms that instantiate the components in the SNEE architecture, thereby supporting integrated query planning that includes routing, placement and timing; and (6) an empirical performance evaluation of the resulting framework.
  	</para>
  </abstract>
</journal>

<conference>
	<title>Enabling ontology-based access to streaming data sources</title>
	<authors>
		<author><name>Jean-Paul Calbimonte</name><notLast/></author>
		<author><name>Oscar Corcho</name><notLast/></author>
		<author><name>Alasdair J. G. Gray</name></author>
	</authors>
	<month>November</month>
	<year>2010</year>
	<location>Shanghai, China</location>
	<url>iswc2010.pdf</url>
	<pages>96-111</pages>
	<booktitle>proceedings 9th International Semantic Web Conference (ISWC 2010)</booktitle>
	<presentation>Publications/iswc2010Presentation.pptx</presentation>
	<abstract>
		<id>iswc2010</id>
		<para>
The availability of streaming data sources is progressively increasing thanks to the development of ubiquitous data capturing technologies such as sensor networks. The heterogeneity of these sources introduces the requirement of providing data access in a unified and coherent manner, whilst allowing the user to express their needs at an ontological level. In this paper we describe an ontology-based streaming data access service. Sources link their data content to ontologies through S2O mappings. Users can query the ontology using SPARQLStream, an extension of SPARQL for streaming data. A preliminary implementation of the approach is also presented. With this proposal we expect to set the basis for future efforts in ontology-based streaming data integration.
		</para>
	</abstract>
</conference>

<conference>
	<title>Whither BNCOD? The Future of Database and Information Systems Research (Panel)</title>
	<authors>
		<author><name>Alasdair J. G. Gray</name></author>
	</authors>
	<month>July</month>
	<year>2010</year>
	<location>Dundee, UK</location>
	<url>bncod2010.pdf</url>
<!--	<pages>96-111</pages>-->
	<booktitle>proceedings 27th British National Conference on Databases (BNCOD 2010)</booktitle>
	<presentation>Publications/bncod2010Presentation.pptx</presentation>
	<abstract>
		<id>bncod2010</id>
		<para>
The British National Conference on Databases (BNCOD), now in its 27th edition, has covered a broad range of database research topics: from the purely theoretical, to more application-oriented subjects. It has proved to be a forum for intellectual debate, and has fostered a sense of community amongst British and overseas database researchers. Databases have been incredibly successful with most businesses relying on them. However, there are still plenty of challenges that remain to be solved. This paper reflects back on the successes of the BNCOD series, and identifies the challenges that remain, thus showing the continuing importance of the BNCOD conference series.
		</para>
	</abstract>
</conference>

<journal>
  <title>Finding the Right Term: Retrieving and Exploring Semantic Concepts in Astronomical Vocabularies</title>
  <year>2010</year>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Norman Gray</name><notLast/></author>
    <author><name>Christopher W Hall</name><notLast/></author>
    <author><name>Iadh Ounis</name></author>
  </authors>
  <url>http://dx.doi.org/10.1016/j.ipm.2009.09.004</url>
  <booktitle>Information Processing and Management</booktitle>
  <volume>46(4)</volume>
  <pages>470-478</pages>
  <abstract>
  	<id>ipm2010</id>
  	<para>
  		Astronomy, like many domains, already has several sets of terminology in general use, referred to as controlled vocabularies. For example, the keywords for tagging journal articles, or the taxonomy of terms used to label image files. These existing vocabularies can be encoded into skos, a W3C proposed recommendation for representing vocabularies on the Semantic Web, so that computer systems can help users to search for and discover resources tagged with vocabulary concepts. However, this requires a search mechanism to go from a user-supplied string to a vocabulary concept.
  	</para>
  	<para>
  		In this paper, we present our experiences in implementing the Vocabulary Explorer, a vocabulary search service based on the Terrier Information Retrieval Platform. We investigate the capabilities of existing document weighting models for identifying the correct vocabulary concept for a query. Due to the highly structured nature of a skos encoded vocabulary, we investigate the effects of term weighting (boosting the score of concepts that match on particular fields of a vocabulary concept), and query expansion. We found that the existing document weighting models provided very high quality results, but these could be improved further with the use of term weighting that makes use of the semantic evidence 
  	</para>
  </abstract>
</journal>

<seminar>
  <title>Distributed Query Processing over Streaming and Stored Heterogenous Data Sources</title>
  <month>April</month>
  <year>2010</year>
  <url>Publications/cardiffSeminar2010.pptx</url>
  <occasion>Seminar talk given to the Knowledge and Information Systems research group at the University of Cardiff</occasion>
  <abstract>
    <id>cardiffSeminar2010</id>
    <para>
The availability of streaming data sources is progressively increasing thanks to the development of ubiquitous data capturing technologies such as sensor networks.
Users of streaming data often need to combine multiple sources with widely different capabilities: streams of data from sensors with extremely limited resources, streams of data from robust network sources, historic archives of stream data, and stored data from databases. 
The availability of resources in the last three types of sources is seemingly unlimited when compared with the wireless sensor networks. 
We propose distributed query processing as a solution to the problem of co-ordinating access to the distributed data sources in an efficient and timely manner whilst considering the capabilities of the sources and the characteristics of the data. 
    </para>
    <para>
Several challenges that must be overcome, in particular different query processing capabilities, different data characteristics, and the availability of resources for processing and storing data.
Another key challenge is that there is no standardised query language for incorporating data from pull-stream, push-stream, and stored sources. 
In this talk we present SNEEql as a declarative query language, which has a well defined evaluation semantics, for expressing data needs in a unified way over such data sources. 
We then show how the execution of a SNEEql query is divided into parts that are evaluated over the relevant data sources.
    </para>
  </abstract>
</seminar>

<seminar>
  <title>The Explicator Project: Integrating Astronomy Data with Semantic Web Tools</title>
  <month>August</month>
  <year>2009</year>
  <url>Publications/imgSeminar2009-explicator.pptx</url>
  <occasion>Seminar talk given to the Information Management Group 
  	at the University of Manchester</occasion>
  <abstract>
  	<id>imgSeminar2009</id>
  	<para>
        In this seminar I will report on the work conducted in the initial 18 months of the Explicator project which aims to use semantic web tools to integrate astronomy data. We addressed two of the key challenges when integrating data from multiple heterogeneous sources: (i) locating those data sources that contain data of interest, and (ii) understanding the data models in order to pose a query to extract the required data. For the first of these challenges, we investigated how to search for relevant sources using SKOS encoded vocabularies and the information retrieval techniques implemented in the Terrier Platform. For the second we investigated the use of RDB2RDF tools for exposing existing relational data sources.
	</para>
  </abstract>
</seminar>

<seminar>
  <title>Using Semantic Web Technology to Integrate Scientific Data</title>
  <month>June</month>
  <year>2009</year>
  <url>Publications/bozen-seminar-2009.pptx</url>
  <occasion>Seminar talk given to the Knowledge Representation meets Databases 
  	group at the Free University of Bozen-Bolzano</occasion>
  <abstract>
  	<id>bozenSeminar2009</id>
  	<para>
  		There are two key challenges when integrating data from multiple 
  		heterogeneous sources: (i) locating those data sources that contain 
  		data of interest, and (ii) understanding the data models in order to 
  		pose a query to extract the required data. We will illustrate these 
  		problems with examples drawn from astronomy and environmental 
  		monitoring; and examine how Semantic Web technologies may be employed 
  		to solve them. In particular, we will consider how an astronomer can 
  		locate and access data using terminology and a data model with which 
  		they are familiar by making use of SKOS encoded vocabularies, RDB2RDF 
  		tools, and semantic mappings. We will also consider how streams of data 
  		from sensor networks can be combined with tradiational data sources and 
  		accessed using ontologies.
	</para>
  </abstract>
</seminar>

<conference>
	<title>Can RDB2RDF Tools Feasibily Expose Large Science Archives for Data Integration?</title>
	<authors>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Norman Gray</name><notLast/></author>
		<author><name>Iadh Ounis</name></author>
	</authors>
	<month>June</month>
	<year>2009</year>
	<location>Heraklion (Crete, Greece)</location>
	<url>eswc2009.pdf</url>
	<pages>491-505</pages>
	<booktitle>proceedings 6th European Semantic Web Conference (ESWC 2009)</booktitle>
	<presentation>Publications/eswc2009Presentation.pptx</presentation>
	<abstract>
		<id>eswc2009</id>
		<para>
			Many science archive centres publish very large volumes of image, 
			simulation, and experiment data. In order to integrate and analyse 
			the available data, scientists need to be able to (i) identify and 
			locate all the data relevant to their work; (ii) understand the 
			multiple heterogeneous data models in which the data is published; 
			and (iii) interpret and process the data they retrieve. RDF has 
			been shown to be a generally successful framework within which to 
			perform such data integration work. It can be equally successful in 
			the context of scientific data, if it is demonstrably practical to 
			expose that data as RDF.
		</para>
		<para>
			In this paper we investigate the capabilities of RDF to enable the 
			integration of scientific data sources. Specifically, we discuss 
			the suitability of SPARQL for expressing scientific queries, and 
			the performance of several triple stores and RDB2RDF tools for 
			executing queries over a moderately sized sample of a large 
			astronomical data set. We found that more research and improvements 
			are required into SPARQL and RDB2RDF tools to efficiently expose 
			existing science archives for data integration.
		</para>
	</abstract>
</conference>

<workshop>
	<title>Searching and exploring controlled vocabularies</title>
	<authors>
		<author><name>A.J.G. Gray</name><notLast/></author>
		<author><name>N. Gray</name><notLast/></author>
		<author><name>I. Ounis</name></author>
	</authors>
	<month>February</month>
	<year>2009</year>
	<booktitle>Exploiting Semantic Annotations in Information Retrieval (ESAIR 2009)</booktitle>
	<location>Barcelona (Spain)</location>
	<pages>1-5</pages>
	<url>Publications/esair2009.pdf</url>
	<abstract>
		<id>esair2009</id>
		<para>
			Within most domains of discourse, there exists different terminology
  			used by distinct sub-groups. Often the terms used can be, or have
  			already been, organised into controlled vocabularies which can be
  			encoded into SKOS, a W3C standard for representing vocabularies. 
  			This terminology can then be used to help users to search for and 
  			discover resources.  This requires a search mechanism to go from a 
  			user-supplied string to a vocabulary concept.
		</para>
		<para>
  			In this paper, we discuss the issues encountered in developing a web
  			service for searching and exploring the concepts in SKOS encoded
  			astronomical vocabularies. Our prototype service takes in a query
  			and responds with the concepts which are the best match. It then 
  			supports the user in exploring the concepts' formal definition and 
  			alternative forms, as well as their relationship to other concepts. 
  			When we add mappings between the concepts in different vocabularies 
  			(where available), these further enrich the explorations of 
  			vocabulary concepts.
  		</para>
	</abstract>
</workshop>

<conference>
	<title>Vocabularies in the VO</title>
	<authors>
		<author><name>A.J.G. Gray</name><notLast/></author>
		<author><name>N. Gray</name><notLast/></author>
		<author><name>I. Ounis</name></author>
	</authors>
	<month>November</month>
	<year>2008</year>
	<location>Québec City (Canada)</location>
	<booktitle>proceedings of 18th Astronomical Data Analysis Software and Systems conference (ADASS XVIII)</booktitle>
	<url>Publications/adass2008.pdf</url>
	<presentation>Publications/adass2008Presentation.pptx</presentation>
	<abstract>
		<id>adass2008</id>
		<para>
			There are multiple controlled vocabularies, or thesauri, within 
			astronomy, of which the best known are the 1993 IAU thesaurus and 
			the keyword list maintained by A&amp;A, ApJ and MNRAS. Over the last 
			year, there has been an effort within the IVOA to formalise the 
			presentation of these vocabularies into a form that will allow 
			greater automated interaction with them, in particular on the Web. 
			The IVOA has adopted the W3C SKOS standard, which makes links with 
			the Semantic Web and looks forward to richer applications using the 
			technologies of that domain. We will summarise this work, and 
			highlight some of the immediate and medium-term possibilities of 
			vocabularies and their more sophisticated cousins, ontologies.
		</para>
		<para>
			Vocabulary aware applications can benefit from improvements in both 
			precision and recall when searching for bibliographic or science 
			data, and lightweight intelligent filtering for services such as 
			VOEvent streams. An important part of this is mapping between 
			precisely or roughly comparable terms in two vocabularies or, in 
			the longer term, two analogous but distinct data models.
		</para>
		<para>
			In particular, we will describe and demonstrate our 
			VocabularyExplorer application, and its companion Mapping Editor. 
			These combine Semantic Web and Information Retrieval technologies 
			to (i) illustrate the way in which formal vocabularies might be 
			used in a practical application, (ii) provide an online service 
			which will allow astronomers to explore and relate existing 
			vocabularies, and (iii) provide an embeddable service to help 
			applications translate free text user queries into formal 
			vocabulary terms.
		</para>
	</abstract>
</conference>

<workshop>
	<title>Accessing Existing Distributed Science Archives As RDF Models</title>
	<authors>
		<author><name>A.J.G. Gray</name><notLast/></author>
		<author><name>N. Gray</name><notLast/></author>
		<author><name>I. Ounis</name></author>
	</authors>
	<month>September</month>
	<year>2008</year>
	<location>Edinburgh (Scotland)</location>
	<booktitle>proceedings of the UK All Hands Meeting (AHM 2008)</booktitle>
	<url>Publications/ahmAbstract2008.pdf</url>
	<presentation>Publications/ahm2008Presentation.pptx</presentation>
</workshop>

<poster>
	<title>Finding data resources in a virtual observatory using SKOS vocabularies</title>
	<authors>
		<author><name>A.J.G. Gray</name><notLast/></author>
		<author><name>N. Gray</name><notLast/></author>
		<author><name>I. Ounis</name></author>
	</authors>
	<booktitle>proceedings of the British National Conference on Databases (BNCOD 25)</booktitle>
	<month>July</month>
	<year>2008</year>
	<location>Cardiff (Wales)</location>
	<pages>189-192</pages>
	<url>Publications/bncod25.pdf</url>
	<abstract>
		<id>bncod25</id>
		<para>
			One problem faced by astronomers using the virtual observatory is 
			finding which of the multitude of data resources is relevant for 
			them. The current tool, VOExplorer, relies on matching searches 
			against tags provided by the resources. This paper shows how skos 
			encoded vocabularies can be used to improve the search results. The 
			techniques are general and applicable to any loose collaborations 
			sharing their resources.
		</para>
	</abstract>
</poster>

<misc>
	<title>Vocabularies in the Virtual Observatory</title>
	<month>November</month>
	<year>2008</year>
	<url>http://www.ivoa.net/Documents/latest/Vocabularies.html</url>
	<authors>
		<author><name>A.J.G. Gray</name><notLast/></author>
		<author><name>N. Gray</name><notLast/></author>
		<author><name>F.V. Hessmann</name><notLast/></author>
		<author><name>A. Preite Martinez (Eds)</name></author>
	</authors>
	<description>IVOA Proposed Recommendation</description>
	<abstract>
		<id>vocab-standard</id>
		<para>
			As the astronomical information processed within the Virtual 
		Observatory becomes more complex, there is an increasing need for a more 
		formal means of identifying quantities, concepts, and processes not 
		confined to things easily placed in a FITS image, or expressed in a 
		catalogue or a table. This document specifies a standard format for 
		vocabularies based on the W3C's Resource Description Framework (RDF) and 
		Simple Knowledge Organization System (SKOS). By adopting a standard and 
		simple format, the IVOA will permit different groups to create and 
		maintain their own specialised vocabularies while letting the rest of 
		the astronomical community access, use, and combine them. The use of 
		current, open standards ensures that VO applications will be able to tap 
		into resources of the growing semantic web. Several examples of useful 
		astronomical vocabularies are provided, including work on a common IVOA 
		thesaurus intended to provide a semantic common base for VO applications.
		</para>
	</abstract>
</misc>

<misc>
	<title>Semantically Enabled Vocabularies in Astronomy</title>
	<month>December</month>
	<year>2007</year>
	<url>Publications/vocabulariesInAstronomy.pdf</url>
	<authors>
		<author><name>Alasdair J. G. Gray</name><notLast/></author>
		<author><name>Norman Gray</name><notLast/></author>
		<author><name>Paul Millar</name><notLast/></author>
		<author><name>Iadh Ounis</name></author>
	</authors>
	<description>Technical report, University of Glasgow</description>
	<abstract>
		<id>tech-tep-glasgow</id>
		<para>
			Astronomy as a discipline incorporates a broad range of topics, 
			from x-rays to radio, and a wide range of expertise, from 
			professional researchers via amateurs to popular interest. As a 
			result, multiple independent controlled vocabularies have evolved 
			to meet the various needs of these different user groups. 
			Unfortunately, several of these vocabularies and thesauri are only 
			semi-formal, and often lack significant cross-application support.
		</para>
		<para> 
			As part of the international Virtual Observatory interoperability 
			effort, we are developing techniques to enable application support 
			for astronomers to query resources described in any vocabulary 
			using one with which they are familiar. In this paper, we describe 
			our experience of formalising and linking astronomy vocabularies 
			via peer-to-peer mappings using SKOS, a language for modelling 
			knowledge organisation systems. We also present our findings on the 
			types of mappings required to relate the concepts of the 
			vocabularies and describe the relationship with the Virtual 
			Observatory's ontology developments. 
		</para>
	</abstract>
</misc>

<misc>
  <title>Integration Distributed Data Streams</title>
  <month>October</month>
  <year>2007</year>
  <url>Publications/thesis-final_web-copy.pdf</url>
  <authors>
    <author><name>Alasdair J. G. Gray</name></author>
  </authors>
  <description>PhD Thesis</description>
  <abstract>
  	<id>thesis</id>
  	<para>			
 		There is an increasing amount of information being made	available 
		as data streams, e.g. stock tickers, data from sensor networks, 
 		smart homes, monitoring data, etc. In many cases, this data is 
		generated by distributed sources under the control of many different 
		organisations. Users would like to seamlessly query such data 
		without prior knowledge of where it is located or how it is 
		published. This is similar to the problem of integrating data 
		residing in multiple heterogeneous stored data sources. However, 
		the techniques developed for stored data are not applicable due to 
		the continuous and long-lived nature of queries over data streams.
  	</para>
	<para>
		This thesis proposes an architecture for a stream integration system. 
		A key feature of the architecture is a republisher component that 
		collects together distributed streams and makes the merged stream 
		available for querying. A formal model for the system has been 
		developed and is used to generate plans for executing continuous 
		queries which exploit the redundancy introduced by the republishers. 
		Additionally, due to the long-lived nature of continuous queries, 
		mechanisms for maintaining the plans whenever there is a change in the 
		set of data sources have been developed. A prototype of the system has 
		been implemented and performance measures made.
	</para>
	<para>
		The work of this thesis has been motivated by the problem of retrieving 
		monitoring information about Grid resources. However, the techniques 
		developed are general and can be applied wherever there is a need to 
		publish and query distributed data involving data streams.
	</para>
  </abstract>
</misc>

<journal>
  <title>Answering Queries over Incomplete Data Stream Histories</title>
  <year>2007</year>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name><notLast/></author>
    <author><name>Howard Williams</name></author>
  </authors>
  <url>Publications/ijwis2007.pdf</url>
  <booktitle>International Journal on Web Information Systems</booktitle>
  <volume>3(1/2)</volume>
  <pages>41-60</pages>
  <abstract>
  	<id>ijwis2007</id>
  	<para>
  		Purpose of this paper
  	</para>
  	<para>
  		Distributed data streams are an important topic of current research. In 
  		such a setting, data values will be missed, e.g. due to network errors. 
  		This paper allows this incompleteness to be detected and overcome with 
  		either the user not being affected or the effects of the incompleteness 
  		being reported to the user. 
  	</para>
  	<para>
  		Design/Methodology/Approach
  	</para>
  	<para>
  		A model for representing the incomplete information has been developed 
  		that captures the information that is known about the missing data. 
  		Techniques for query answering involving certain and possible answer 
  		sets have been extended so that queries over incomplete data stream 
  		histories can be answered. 
  	</para>
  	<para>
  		Findings
  	</para>
  	<para>
  		It is possible to detect when a distributed data stream is missing one 
  		or more values. When such data values are missing there will be some 
  		information that is known about the data and this is stored in an 
  		appropriate format. 
  	</para>
  	<para>
  		Even when the available data is incomplete, it is possible in some 
  		circumstances to answer a query completely. When this is not possible, 
  		additional meta-data can be returned to inform the user of the effects 
  		of the incompleteness. 
  	</para>
  	<para>
  		Research limitations/implications
	</para>
	<para>
		The techniques and models proposed in this paper have only been 
		partially implemented.
	</para>
	<para>
		Practical Implications
	</para>
	<para>
		The proposed system is general and can be applied wherever there is a 
		need to query the history of distributed data streams. The work in this 
		paper enables the system to answer queries when there are missing 
		values in the data.
	</para>
	<para>
		What is original/value of paper
	</para>
	<para>
		This paper presents a general model of how to detect, represent, and 
		answer historical queries over incomplete distributed data streams. 
	</para>
  </abstract>
</journal>

<conference>
  <title>Answering Arbitrary Conjunctive Queries over Incomplete Data
  Stream Histories</title>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>M Howard Williams</name><notLast/></author>
    <author><name>Werner Nutt</name></author>
  </authors>
  <url>Publications/iiwas2006.pdf</url>
  <month>December</month>
  <year>2006</year>
  <presentation>Publications/iiwas2006talk.ppt</presentation>
  <booktitle>Information Integration and Web-based Application and
  Services (iiWAS2006)</booktitle>
  <pages>259-268</pages>
  <location>Yogyakarta (Indonesia)</location>
  <abstract>
  	<id>iiWAS2006</id>
  	<para>
  		R-GMA is a system that integrates distributed data streams to provide a 
  		global view of all the streams. A user can pose a query to R-GMA and 
  		locate data of interest without needing to know where it is located. 
  		R-GMA has been developed as a grid information and monitoring system 
  		although the techniques developed can be applied wherever there is a 
  		need to publish and query distributed streams.
	</para>
	<para>
		Knowing the values that have occurred on a stream in the past can often 
		lead to a better understanding of how it might behave in the future. 
		For example, in the grid monitoring context this information can be 
		used to spot anomalous behaviour. In order to support this, the history 
		of the streams must be archived.
	</para>
	<para>
		Data streams published by distributed sources are prone to missing data 
		values, e.g. due to a network failure. Since the stream has missed some 
		values, the stored history of the stream contains gaps. This paper 
		considers how to generate the most complete answer possible to a 
		positive conjunctive query over the available stream history. A model 
		for representing the incompleteness in the stream history is provided 
		along with an algorithm that distinguishes when and how the missing 
		data affects the answer to a query. 
	</para>
  </abstract>
</conference>


<conference>
  <title>Sources of Incompleteness in Grid Publishing</title>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name><notLast/></author>
    <author><name>M Howard Williams</name></author>
  </authors>
  <url>http://www.springerlink.com/content/r7724n1732352g30/?p=78e05af5f2ce4cfeb1c56f212ae3b9cd</url>
  <month>July</month>
  <year>2006</year>
  
  <presentation>Publications/bncod23talk.pdf</presentation>
  <booktitle>British National Conference on Databases (BNCOD23)</booktitle>
  <pages>94-101</pages>
  <location>Belfast (UK)</location>
  <abstract>
	<id>bncod23</id>
	<para>
		There is a wide variety of data, both static and streaming, being 
		published on and about computing Grids. However one aspect of Grid data 
		that has received relatively little attention thus far is that of 
		incompleteness. With potentially many data sources available to choose 
		from, each with its own limitations in terms of coverage of data sets 
		and of overall reliability, there are many opportunities for inaccuracy 
		due to incompleteness in the data. In this short paper different types 
		of incompleteness are identified in the context of R-GMA as part of an 
		ongoing research project aimed at finding solutions to some of these. 
	</para>
  </abstract>
</conference>

<conference>
  <title>A Data Stream Publish/Subscribe Architecture with Self-adapting Queries</title>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name></author>
  </authors>
  <month>November</month>
  <year>2005</year>
  <url>Publications/coopis05.pdf</url>
  <booktitle>
    International Conference on Cooperative Information Systems (CoopIS 2005)</booktitle>
  <presentation>Publications/coopis05Talk.ppt</presentation>
  <pages>420-438</pages>
  <location>Agia Napa (Cyprus)</location>
  <abstract>
	<id>coopis05</id>
	<para>
		 In data stream applications, streams typically arise from a 
		 geographically distributed collection of producers and may be queried 
		 by consumers, which may be distributed as well. In such a setting, a 
		 query can be seen as a subscription asking to be informed of all 
		 tuples that satisfy a specific condition. We propose to support the 
		 publishing and querying of distributed data streams by a 
		 publish/subscribe architecture.
	</para>
	<para>
		To enable such a system to scale to a large number of producers and 
		consumers requires the introduction of republishers which collect 
		together data streams and make the merged stream available. If 
		republishers consume from other republishers, a hierarchy of 
		republishers results.
	</para>
	<para>
		We present a formalism that allows distributed data streams, published 
		by independent stream producers, to be integrated as views on a 
		mediated schema. We use the formalism to develop methods to adapt query 
		plans to changes in the set of available data streams and allow 
		consumers to dynamically change which streams they subscribe to.
	</para> 
  </abstract>
</conference>

<misc>
  <title>Republishers in a Publish/Subscribe Architecture for Data Streams</title>
  <month>April</month>
  <year>2005</year>
  <url>Publications/HW-MACS-TR-0031.pdf</url>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name></author>
  </authors>
  <description>This technical report gives the formal arguments of the ideas
    presented in our BNCOD22 paper (see conferences above)</description>
  <abstract>
  	<id>techRep31</id>
  	<para>
  		In data stream applications, streams typically arise from a 
  		geographically distributed collection of producers and may be queried 
  		by consumers, which may be distributed as well. In such a setting, a 
  		query can be seen as a subscription asking to be informed of all tuples 
  		that satisfy a specific condition. We propose to support the publishing 
  		and querying of distributed data streams by a publish/subscribe 
  		architecture. To enable such a system to scale to a large number of 
  		producers and consumers requires the introduction of republishers which 
  		collect together data streams and make the merged stream available. If 
  		republishers consume from other republishers, a hierarchy of 
  		republishers results. We present a formalism that allows distributed 
  		data streams, published by independent stream producers, to be 
  		integrated as views on a mediated schema. We then use this formalism to 
  		develop query planning techniques for the republishers, and methods to 
  		adapt plans when the set of available data streams changes.
  	</para> 
  </abstract>
</misc> 

<conference>
  <title>Republishers in a Publisher/Subscribe Architecture for Data Streams</title>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name></author>
  </authors>
  <month>July</month>
  <year>2005</year>
  <url>Publications/bncod22.pdf</url>    
  <booktitle>British National Conference on Databases (BNCOD22)</booktitle>
  <presentation>Publications/bncod22talk.ppt</presentation>
  <pages>179-184</pages>
  <location>Sunderland (UK)</location>
  <abstract>
  	<id>bncod22</id>
  	<para>
  		We present a publish/subscribe framework for integrating data streams 
  		published by distributed producers. We introduce the idea of 
  		republishers which merge a set of data streams, either from producers or 
  		other republishers. The resulting hierarchy of producers and 
  		republishers can then be used to answer consumer queries over the 
  		streams. We discuss how to compute query plans to create such a 
  		hierarchy and the maintenance of these plans when the set of streams 
  		changes. 
  	</para>
  </abstract>
</conference>

<conference>
  <title>Fault Tolerance in the R-GMA Information and Monitoring System</title>
  <authors>
    <author><name>Rob Byrom</name><notLast/></author>
	<author><name>Brian A. Coghlan</name><notLast/></author>
	<author><name>Andrew W. Cooke</name><notLast/></author>
	<author><name>Roney Cordenonsi</name><notLast/></author>
	<author><name>Linda Cornwall</name><notLast/></author>
	<author><name>Martin Craig</name><notLast/></author>
	<author><name>Abdeslem Djaoui</name><notLast/></author>
	<author><name>Alastair Duncan</name><notLast/></author>
	<author><name>Steve Fisher</name><notLast/></author>
	<author><name>Alasdair J. G. Gray</name><notLast/></author>
	<author><name>Steve Hicks</name><notLast/></author>
	<author><name>Stuart Kenny</name><notLast/></author>
	<author><name>Jason Leake</name><notLast/></author>
	<author><name>Oliver Lyttleton</name><notLast/></author>
	<author><name>James Magowan</name><notLast/></author>
	<author><name>Robin Middleton</name><notLast/></author>
	<author><name>Werner Nutt</name><notLast/></author>
	<author><name>David O'Callaghan</name><notLast/></author>
	<author><name>Norbert Podhorszki</name><notLast/></author>
	<author><name>Paul Taylor</name><notLast/></author>
	<author><name>John Walk</name><notLast/></author>
	<author><name>Antony J. Wilson</name></author>
  </authors>
  <url>http://www.springerlink.com/content/57t3lrhcqu4x39m1/</url>
  <month>February</month>
  <year>2005</year>
  <booktitle>European Grid Conference (ECG 2005)</booktitle>
  <pages>751-760</pages>
  <location>Amsterdam (Netherlands)</location>
  <abstract>
  	<id>ecg2005</id>
  	<para>
  		R-GMA (Relational Grid Monitoring Architecture) [1] is a grid monitoring 
  		and information system that provides a global view of data distributed 
  		across a grid system. R-GMA creates the impression of a single 
  		centralised repository of information, but in reality the information 
  		can be stored at many different locations on the grid. The Registry and 
  		Schema are key components of R-GMA. The Registry matches queries for 
  		information to data sources that provide the appropriate information. 
  		The Schema defines the tables that can be queried. Without the combined 
  		availability of these components, R-GMA ceases to operate as a useful 
  		service. This paper presents an overview of R-GMA and describes the 
  		Registry replication design and implementation. A replication algorithm 
  		for the Schema has also been designed.
  	</para>
  </abstract>
</conference>

<journal>
  <title>The Relational Grid Monitoring Architecture: Mediating Information about the Grid</title>
  <authors>
    <author><name>A W Cooke</name><notLast/></author>
    <author><name>A J G Gray</name><notLast/></author>    
    <author><name>W Nutt</name><notLast/></author>
    <author><name>J Magowan</name><notLast/></author>
    <author><name>M Oevers</name><notLast/></author>
    <author><name>P Taylor</name><notLast/></author>
    <author><name>R Cordenonsi</name><notLast/></author>
    <author><name>R Byrom</name><notLast/></author>
    <author><name>L Cornwall</name><notLast/></author>
    <author><name>A Djaoui</name><notLast/></author>
    <author><name>L Field</name><notLast/></author>
    <author><name>S M Fisher</name><notLast/></author>
    <author><name>S Hicks</name><notLast/></author>
    <author><name>J Leake</name><notLast/></author>
    <author><name>R Middleton</name><notLast/></author>
    <author><name>A Wilson</name><notLast/></author>
    <author><name>X Zhu</name><notLast/></author>
    <author><name>N Podhorszki</name><notLast/></author>
    <author><name>B Coghlan</name><notLast/></author>
    <author><name>S Kenny</name><notLast/></author>
    <author><name>D O'Callaghan</name><notLast/></author>
    <author><name>J Ryan</name></author>
  </authors>
	<month>December</month>
   <year>2004</year>    
    <url>Publications/rgmaMediating.pdf</url>
    <booktitle>Journal of Grid Computing</booktitle>
    <volume>2(4)</volume>
	<pages>323-339</pages>
	<abstract>
		<id>jogc</id>
		<para>
			We have developed and implemented the Relational Grid Monitoring 
			Architecture (R-GMA) as part of the DataGrid project, to provide a 
			flexible information and monitoring service for use by other 
			middleware components and applications.
		</para>

		<para>
			R-GMA presents users with a virtual database and mediates queries 
			posed at this database: users pose queries against a global schema 
			and R-GMA takes responsibility for locating relevant sources and 
			returning an answer. R-GMA s architecture and mechanisms are 
			general and can be used wherever there is a need for publishing and 
			querying information in a distributed environment.
		</para>

		<para>
			We discuss the requirements, design and implementation of R-GMA as 
			deployed on the DataGrid testbed. We also describe some of the ways 
			in which R-GMA is being used.
		</para> 

	</abstract>
</journal>

<journal>
  <title>Stream Integration Techniques for Grid Monitoring</title>
  <year>2005</year>
  <authors>
    <author><name>Andy Cooke</name><notLast/></author>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name></author>
  </authors>
  <url>Publications/streamIntegrationTechniques-JoDS.pdf</url>
  <abstract>
	<id>jods</id>
	<para>
		 Grids are distributed systems that provide access to computational 
		 resources in a transparent fashion. Providing information about the 
		 status of the Grid itself is called Grid monitoring. As an approach to 
		 this problem, we present the Relational Grid Monitoring Architecture 
		 (R-GMA), which tackles Grid monitoring as an information integration 
		 problem.
	</para>
	<para>
		A novel feature of R-GMA is its support for integrating stream data via 
		a simple "local as view" approach. We describe the infrastructure that 
		R-GMA provides for publishing and querying monitoring data. In this 
		context, we discuss the semantics of continuous queries, provide 
		characterisations of query plans, and present an algorithm for 
		computing such plans.
	</para>
	<para>
		The concepts and mechanisms offered by R-GMA are general and can be 
		applied in other areas where there is a need for publishing and 
		querying information in a distributed fashion. 
	</para>
  </abstract>
  <booktitle>Journal on Data Semantics</booktitle>
  <volume>2</volume>
  <pages>136-175</pages>
</journal>

<seminar>
  <title>Integrating Data Streams in Grid Monitoring</title>
  <month>July</month>
  <year>2004</year>
  <url>Publications/bathSeminar.pdf</url>
  <occasion>Seminar talk given at Bath University</occasion>
  <abstract>
  	<id>bathSeminar</id>
  	<para>
  		Grids are distributed systems that provide access to computational 
  		resources in a transparent fashion. Collecting and providing 
  		information about the status of the Grid itself is called Grid 
  		monitoring. We have been involved in the development of the Relational 
  		Grid Monitoring Architecture (R-GMA), in which we approach Grid 
  		monitoring as an information integration problem where information is 
  		published as data streams.
	</para>
	<para>
		We have formalised this integration problem for the simple setting of 
		continuous selection queries. One feature are republishers which are 
		similar to a view in a database: they pose a query and make the answer 
		stream available for other queries. This allows more efficient query 
		plans to be constructed.
	</para>
	<para>
		The query planning problem in this setting is nontrivial for two 
		reasons: (1) In such a distributed environment, it is not clear what 
		the answer to a continuous query should be, and (2) Republishers give 
		rise to redundancy in the available data streams. This gives rise to a 
		choice of sources for answering a query.
	</para>
	<para>
		In this context, we discuss the semantics of continuous queries and 
		give algorithms for computing query plans. We also present methods for 
		adapting the plans in situations where new stream sources come and old 
		ones go during the life time of the query.
	</para>
	<para>
		Our formalisation allows us to show the soundness and correctness of 
		the algorithms. We intend to build upon this work to create and 
		maintain plans for more complex queries. 
	</para>
  </abstract>
</seminar>

<workshop>
    <title>Planning Continuous Selection Queries Using Views</title>
    <authors>
    	<author><name>Alasdair J G Gray</name><notLast/></author>
    	<author><name>Andy Cooke</name><notLast/></author>
    	<author><name>Werner Nutt</name></author>
    </authors>
    <month>April</month>
    <year>2004</year>
    <abstract>
		<id>dagstuhlWorkshop</id>
		<para>
			 The publication of distributed data streams can be found in the 
			 setting of Grid monitoring. In this setting, components of the 
			 Grid must be able to discover information about other Grid 
			 resources. In the Relation Grid Monitoring Architecture (R-GMA), 
			 we approach this as a "local as view" information integration 
			 problem.
		</para>
		<para>
			We have developed a formalisation for the simple setting of 
			continuous selection queries. In this context, we discuss the 
			semantics of continuous queries, provide characterisations of query 
			plans and present an algorithm for computing such plans. The 
			formalisation also allows for straightforward plan maintenance.
		</para>
		<para>
			The main purpose of this work was to get the concepts correct in a 
			simple setting. This allows for the correctness of the planning and 
			maintenance algorithms to be shown. We intend to use this as a 
			foundation for more complex queries. 
		</para>
	</abstract>
    <url>Publications/dagstuhlPresentation.pdf</url>
    <booktitle>
      Workshop on <a href="http://www.dagstuhl.de/04171">Logic Based Information Agents</a>
    </booktitle>
    <location><a href="http://www.dagstuhl.de">Dagstuhl</a> (Germany)</location>
</workshop>

<poster>
  <title>Answering Continuous Queries Using Views</title>
  <authors>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Werner Nutt</name></author>
  </authors>
  <month>April</month>
  <year>2004</year>    
  <url>Publications/prep2004Abstract.pdf</url>
  <booktitle>PREP2004 (Poster)</booktitle>
  <abstract>
	<id>prep2004</id>
	<para>
		In a computational Grid resources need to make details of their current 
		status available to allow scheduling to take place. With our system 
		monitoring information can be published and queried with the latest 
		values always being available.
	</para>
  </abstract>
  <location>Hatfield (UK)</location>
    <url>Publications/prep2004Poster.ppt</url>
</poster>

<seminar>
    <title>Query Planning for Hierarchies of Stream Publishers</title>
    <month>February</month>
    <year>2004</year>
    <url>Publications/dept2ndYearSeminar.pdf</url>
    <occasion>Talk given at Heriot-Watt University during my 2nd year describing 
    the status of my work</occasion>
</seminar>

<conference>
  <title>R-GMA: An Information Integration System for Grid Monitoring</title>
  <authors>
    <author><name>Andy Cooke</name><notLast/></author>
    <author><name>Alasdair J G Gray</name><notLast/></author>
    <author><name>Lisha Ma</name><notLast/></author>
    <author><name>Werner Nutt</name><notLast/></author>
    <author><name>James Magowan</name><notLast/></author>
    <author><name>Manfred Oevers</name><notLast/></author>
    <author><name>Paul Taylor</name><notLast/></author>
    <author><name>Rob Byrom</name><notLast/></author>
    <author><name>Laurence Field</name><notLast/></author>
    <author><name>Steve Hicks</name><notLast/></author>
    <author><name>Jason Leake</name><notLast/></author>
    <author><name>Manish Soni</name><notLast/></author>
    <author><name>Antony Wilson</name><notLast/></author>
    <author><name>Roney Cordenonsi</name><notLast/></author>
    <author><name>Linda Cornwall</name><notLast/></author>
    <author><name>Abdeslem Djaoui</name><notLast/></author>
    <author><name>Steve Fisher</name><notLast/></author>
    <author><name>Norbert Podhorszki</name><notLast/></author>
    <author><name>Brian Coghlan</name><notLast/></author>
    <author><name>Stuart Kenny</name><notLast/></author>
    <author><name>David O'Callaghan</name></author>
  </authors>
  <month>November</month>
  <year>2003</year>    
  <url>Publications/coopis03.pdf</url>
  <booktitle>Cooperative Information Systems (CoopIS 2003)</booktitle>
  <abstract>
	<id>coopis03</id>
	<para>
		 Computational Grids are distributed systems that provide access to 
		 computational resources in a transparent fashion. Collecting and 
		 providing information about the status of the Grid itself is called 
		 Grid monitoring.
	</para>
	<para>
		We describe R-GMA (Relational Grid Monitoring Architecture) as a 
		solution to the Grid monitoring problem. It uses a local as view 
		approach to information integration and will be a component of the 
		European Union's DataGrid.
	</para>
	<para>
		The R-GMA architecture and mechanisms are general and could be used in 
		other areas where there is a need for publishing and querying 
		information in a distributed fashion.
	</para> 
  </abstract>
  <pages>462-481</pages>
  <location>Catania (Italy)</location>
</conference>

</publications>

