Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Compton

dblp:73/1427 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 7 · 4 first-authorArtificial intelligence and machine learning · 1Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 67% Database theory · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Database theory › query containment
conjunctive query containment
0.112009
Finding Equivalent Rewritings with Exact Views · ICDE 2009
Query processing and optimization › query rewriting
query answering using views
0.112009
Finding Equivalent Rewritings with Exact Views · ICDE 2009
Query processing and optimization
query rewriting
0.112009
Finding Equivalent Rewritings with Exact Views · ICDE 2009
YearPublicationVenuePosition
2017 Visualizing OWL 2 using diagrams
abstract
Diagrams can be an effective means of communicating complex ideas and can aid ontology engineering. Indeed, domain experts often do not have the expertise required to understand or create the complex logical statements of an ontology in description logic (DL). This paper presents a visualisation method, concept diagrams, geared toward expressing assertions and class expression axioms alongside providing support for literals, datatypes and data properties. Property diagrams are introduced, targeted at object property and data property expression axioms. We demonstrate that concept diagrams and property diagrams provide a large coverage of OWL 2 axioms and are, thus, closely aligned in expressive power.
Gem Stapleton, Michael Compton, John Howse
VL/HCC2
2015 Declarative Data Exchange: Spreadsheets to RDF/OWL
abstract
Integrating and accessing data from the many existing formats is a key challenge for the Semantic Web. In particular, representing and understanding non-RDF/OWL data in terms of ontologies is important for reasoning about this data and its relationships to other data, and for extracting or accessing the data itself. This paper presents a declarative method for mapping and translating spreadsheet data to RDF/OWL. First, a declarative mapping language is presented. Then, for this syntax, the paper presents a declarative semantics in terms of matrix operations as abstractions over spreadsheets and the relations therein. The language supports arbitrary search and indexing functions over spreadsheet data and allows the generation of complex associations and aggregations in the RDF/OWL output. Imperative and functional implementations of the mapping and extraction technology are presented.
Michael Compton, David Ratcliffe, Yanfeng Shu, Geoffrey Squire
IDEAS1
2015 Complex Role Inclusions with Role Chains on the Right are Expressible in SROIQ
abstract
The syntax of both SROIQ and OWL 2 allow complex role inclusion axioms where the role composition occurs on the left of the subsumption relation, but not where the role composition occurs on the right. This paper proves that, despite the lack of syntax, SROIQ, and consequently OWL 2, can already express such complex role inclusions. This is shown by proving that complex role inclusion axioms where the role composition occurs on the right of the subsumption relation can already be expressed in terms of complex role inclusions on the left. The resulting syntactic restrictions are similar to those already present in SROIQ and OWL 2.
Michael Compton
Int. J. Semantic Web Inf. Syst.1
2015 A semantic approach to data translation: A case study of environmental observations data
Yanfeng Shu, David Ratcliffe, Michael Compton, Geoffrey Squire, Kerry L. Taylor
Knowl. Based Syst.3
2014 A Use Case in Semantic Modelling and Ranking for the Sensor Web
Liliana Cabral, Michael Compton, Heiko Müller 0001
ISWC (2)2
2013 Context-Aware Sensor Search, Selection and Ranking Model for Internet of Things Middleware
abstract
As we are moving towards the Internet of Things (IoT), the number of sensors deployed around the world is growing at a rapid pace. Market research has shown a significant growth of sensor deployments over the past decade and has predicted a substantial acceleration of the growth rate in the future. It is also evident that the increasing number of IoT middleware solutions are developed in both research and commercial environments. However, sensor search and selection remain a critical requirement and a challenge. In this paper, we present CASSARAM, a context-aware sensor search, selection, and ranking model for Internet of Things to address the research challenges of selecting sensors when large numbers of sensors with overlapping and sometimes redundant functionality are available. CASSARAM proposes the search and selection of sensors based on user priorities. CASSARAM considers a broad range of characteristics of sensors for search such as reliability, accuracy, battery life just to name a few. Our approach utilises both semantic querying and quantitative reasoning techniques. User priority based weighted Euclidean distance comparison in multidimensional space technique is used to index and rank sensors. Our objectives are to highlight the importance of sensor search in IoT paradigm, identify important characteristics of both sensors and data acquisition processes which help to select sensors, understand how semantic and statistical reasoning can be combined together to address this problem in an efficient manner. We developed a tool called CASSARA to evaluate the proposed model in terms of resource consumption and response time.
Charith Perera, Arkady B. Zaslavsky, Peter Christen, Michael Compton, Dimitrios Georgakopoulos 0001
MDM (1)4
2013 Towards Content-Aware SPARQL Query Caching for Semantic Web Applications
Yanfeng Shu, Michael Compton, Heiko Müller 0001, Kerry L. Taylor
WISE (1)2
2012 The SSN ontology of the W3C semantic sensor network incubator group
abstract
The W3C Semantic Sensor Network Incubator group (the SSN-XG) produced an OWL 2 ontology to describe sensors and observations — the SSN ontology, available at http://purl.oclc.org/NET/ssnx/ssn. The SSN ontology can describe sensors in terms of capabilities, measurement processes, observations and deployments. This article describes the SSN ontology. It further gives an example and describes the use of the ontology in recent research projects.
Michael Compton, Payam M. Barnaghi, Luis Bermudez, Raúl García-Castro, Óscar Corcho, Simon J. D. Cox, John B. Graybeal, Manfred Hauswirth, Cory A. Henson, Arthur Herzog, Vincent Huang 0002, Krzysztof Janowicz, W. David Kelsey, Danh Le Phuoc, Laurent Lefort, Myriam Leggieri, Holger Neuhaus, Andriy Nikolov, Kevin R. Page, Alexandre Passant, Amit P. Sheth, Kerry L. Taylor
J. Web Semant.1
2011 On self-configuration of sensor network services
abstract
Due to environmental and contextual changes, it is often required to configure and re-configure sensor network services. The burden of programming a sensor network, as a consequence of these changes, can be alleviated with a plug-and-play approach that allows dynamic adaptation of sensor network services. In this paper, we briefly present a semantics-based methodology to avail self-configuration of sensor services with minimal human intervention. We also provide a practical usage scenario and our preliminary work in this context.
Mukaddim Pathan, Kerry L. Taylor, Michael Compton
CCNC3
2009 Finding Equivalent Rewritings with Exact Views
abstract
This paper presents a study of equivalent rewritings for conjunctive queries and views: that is, queries and views expressed in terms of database predicates, but not built-in predicates. It analyses conjunctive queries and views with an exact, set semantics, corrects some errors in prior work and shows necessary and sufficient conditions on the query and views for an equivalent rewriting to exist, including showing when a view covers part of a query. The paper presents a sound and complete algorithm for finding equivalent rewritings.
Michael Compton
ICDE1