Derek Colley

Derek Colley
Staffordshire University | SU · School of Computing

Doctor of Philosophy

About

8
Publications
4,046
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
12
Citations
Introduction
Derek Colley is a researcher in data management at Staffordshire University, and maintains a professional practice as a database consultant with more than fifteen years of extensive industry experience. He holds M.Sc and B.Sc degrees in Computer Science, a Postgraduate Diploma in Information Security and Digital Forensics and a Doctorate in Computing Science. His research interests include data management and information representation theory.

Publications

Publications (8)
Conference Paper
Using a large, publicly-available dataset [1], we extract over 51 million product reviews. We split and associate each word of each review comment with the review score and store the resulting 3.7 billion word-and score pairs in a relational database. We cleanse the data, grooming the dataset against a standard English dictionary, and create an agg...
Conference Paper
Database queries are stored and compared by relational database management systems as hashes, or short unique representations, of the original query text. This leads to cache misses and increased resource consumption by database engines when queries differing only in non-syntactic detail, or queries which are relation-ally equivalent, are presented...
Preprint
Relational database management systems are responsible for storing, managing, and providing access to persisted data for applications and individual users. Although a mature technology, there remains a severe performance issue within the database engine; as data influx continues to scale and object-relational mapping (ORM) frameworks become the nor...
Article
The object-relational impedance mismatch (ORIM) problem characterises differences between the object-oriented and relational approaches to data access. Queries generated by object-relational mapping (ORM) frameworks are designed to overcome ORIM difficulties and can cause performance concerns in environments which use object-oriented paradigms. The...
Presentation
Full-text available
Description of concepts and purpose of paper, and expanding on the outcomes.
Conference Paper
Full-text available
This paper considers the impact of object-relational mapping (ORM) tools on relational database query performance. ORM tools are widely used to address the object-relational impedance mismatch problem but can have negative performance consequences. We first define the background of the problem, describing the growth of ORM tools against a backdrop...
Thesis
Relational Database Management Systems (RDBMSs) are software systems concerned with the management and administration of data. Data security can be defined as the continuance of confidentiality, integrity and availability in an RDBMS so that data remains protected from internal and external threats. In this research, we argue that data security is...
Conference Paper
Full-text available
Database performance tuning is a complex and varied active research topic. With enterprise relational database management systems still reliant on the set-based relational concepts that defined early data management products, the disparity between the object-oriented application development model and the object-relational database model, called the...

Network

Cited By

Projects

Project (1)
Project
The aim of this research is to discover the disadvantages of current object-relational database storage and retrieval models in terms of performance and efficiency, and to develop conceptual extensions to, or partial replacements of, these models using a data-first approach, delivering a cross-platform Dynamic Design Framework incorporating new automatic dynamically-responsive design techniques. As a secondary aim, to determine if the characteristics of data can be used to taxonomise data, and whether the outputs of this process can be used to refine or contribute to the structure of the Dynamic Design Framework. The purposes of pursuing these aims are to provide more efficient data storage and retrieval methodologies, in recognition that the key characteristics of data flows have rapidly mutated and grown in the last decade, which has challenged the suitability of the object-relational database as a viable system for future data management.