Querying Data-Intensive Programs for Data Design

Shao, Jianhua ORCID: https://orcid.org/0000-0001-8461-1471, Liu, Xingkun, Fu, G., Embury, Suzanne M. and Gray, William Alexander 2001. Querying Data-Intensive Programs for Data Design. Lecture Notes in Computer Science 2068 , pp. 203-218. 10.1007/3-540-45341-5_14

Full text not available from this repository.

Abstract

A data-intensive program is one in which much of the complexity and design effort is centred around data definition and manipulation. Many organisations have substantial investment in data design (data structures and constraints) coded in data intensive programs. While there is a rich collection of techniques that can extract data design from database schemas, the extraction of data design from data intensive programs is still largely an unsolved problem. In this paper, we propose a query-based approach to this problem. Our approach allows users (maintainers or reverse engineers) to express a complex extraction task as a sequence of queries over the source program. Unlike conventional techniques, which are designed for extracting a specific aspect of a data design, our approach gives the user the control over what to extract and how it may be extracted in an exploratory manner. Given the variety of coding styles used in data intensive programs, we believe that the exploratory feature of our approach represents a plausible way forward for extracting data design from data intensive programs. We demonstrate the usefulness of our approach with a number of examples.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer Verlag
ISSN:	0302-9743
Last Modified:	18 Oct 2022 13:23
URI:	https://orca.cardiff.ac.uk/id/eprint/13711

Citation Data

Actions (repository staff only)

Edit Item