Relational Database Applications Research Articles

Design and development of a web-based application for diabetes patient data management

A web-based database management system developed for collecting, managing and analysing information of diabetes patients is described here. It is a searchable, client-server, relational database application, developed on the Windows platform using Oracle, Active Server Pages (ASP), Visual Basic Script (VB Script) and Java Script. The software is menu-driven and allows authorized healthcare providers to access, enter, update and analyse patient information. Graphical representation of data can be generated by the system using bar charts and pie charts. An interactive web interface allows users to query the database and generate reports. Alpha- and beta-testing of the system was carried out and the system at present holds records of 500 diabetes patients and is found useful in diagnosis and treatment. In addition to providing patient data on a continuous basis in a simple format, the system is used in population and comparative analysis. It has proved to be of significant advantage to the healthcare provider as compared to the paper-based system.

A relational database for the monitoring and analysis of watershed hydrologic functions: I. Database design and pertinent queries

The need to monitor water quantity and quality has increased dramatically in recent years due to total maximum daily load requirements that address non-point source pollutants in our nation's water bodies. This has resulted in the need for data management techniques and tools to manage the vast amount of new hydrologic data being collected. Data must be stored, checked for errors, manipulated, retrieved for analysis, and shared within the hydrologic community. The Watershed Monitoring and Analysis Database is a relational database application developed as a data management tool to efficiently and accurately address the needs of individuals and groups responsible for maintaining hydrologic data sets. Stream flow, water quality, and meteorological data can be stored and manipulated within the database. Both remedial and advanced tasks can be simplified with the help of the user interface application, such as quality assurance/quality control (QA/QC) calculations, application of correction and conversion factors, retrieval of desired data for advanced analysis, and data comparisons among multiple study sites. Web integration and local area network (LAN) database synchronization can be supported depending upon the database engine used. The objectives of this paper are to: (1) present in detail the database architecture, including table structures and overall database design, and (2) provide useful queries to retrieve data that involve calculations, comparisons, and basic QA/QC protocols. Developed using Microsoft Access, the concepts and strategies covered in this paper may be applied to any commercially available relational database.

Poxvirus Bioinformatics Resource Center: a comprehensive Poxviridae informational and analytical resource

The Poxvirus Bioinformatics Resource Center (PBRC) has been established to provide informational and analytical resources to the scientific community to aid research directed at providing a better understanding of the Poxviridae family of viruses. The PBRC was specifically established as the result of the concern that variola virus, the causative agent of smallpox, as well as related viruses, might be utilized as biological weapons. In addition, the PBRC supports research on poxviruses that might be considered new and emerging infectious agents such as monkeypox virus. The PBRC consists of a relational database and web application that supports the data storage, annotation, analysis and information exchange goals of the project. The current release consists of over 35 complete genomic sequences of various genera, species and strains of viruses from the Poxviridae family. Sequence and annotation information for these viruses has been obtained from sequences publicly available from GenBank as well as sequences not yet deposited in GenBank that have been obtained from ongoing sequencing projects. In addition to sequence data, the PBRC provides comprehensive annotation and curation of virus genes; analytical tools to aid in the understanding of the available sequence data, including tools for the comparative analysis of different virus isolates; and visualization tools to help better display the results of various analyses. The PBRC represents the initial development of what will become a more comprehensive Viral Bioinformatics Resource Center for Biodefense that will be one of the National Institute of Allergy and Infectious Diseases' ‘Bioinformatics Resource Centers for Biodefense and Emerging or Re-Emerging Infectious Diseases’. The PBRC website is available at http://www.poxvirus.org.

Testing web database applications

Commercial, scientific, and social activities are increasingly becoming dependent on Web database applications. New testing techniques that handle the unique features of these systems are needed. To that end, we have extended AGENDA, a tool set for testing relational database applications, to test web database applications. Application source code is analyzed to extract relevant information about the URLs and their parameters. This information is used to construct and simplify a graph in which nodes represent URLs and edges represent links between URLs. A set of paths through the graph is selected and test cases are generated for each path. The extracted information about the parameters to each URL (e.g., values that an application user would enter into a form), is used to guide AGENDA to generate inputs for the URLs. The URLs on a path and their inputs are stored in an XML file, which is then automatically executed. The current implementation is targeted toward web applications written as Java Servlets and uses an algorithm based on cyclomatic complexity to generate paths. Preliminary empirically evaluation based on the TPC-W benchmark is presented.

GIS-based decision support for solar energy planning in urban environments

This paper describes the development of a solar energy planning system, consisting of a methodology and decision support software for planners and energy advisers. Intended primarily to predict and realise the potential of solar energy on an urban scale, the system will support decisions in relation to the key solar technologies: solar water heating, photovoltaics and passive solar gain. The prototype discussed here relates to the first of these. Based on a methodology for predicting the solar energy potential of domestic housing stock, it is implemented as a relational database application linked to a customised geographical information system (GIS). The methodology takes into account baseline energy consumption and projected energy saving benefits. To support this, the system incorporates a domestic energy model and addresses the major problem of data collection in two ways. Firstly, it provides a comprehensive set of default values derived from a new dwelling classification scheme that builds on previous research. Secondly, novel GIS tools enable key data to be extracted from digital urban maps in different operational modes. The paper concludes with a discussion of possible planning scenarios to illustrate how the system may be deployed at various levels of granularity to assist targeting of individual properties or city neighbourhoods, or for whole-city projections.

WWW interfaces for runtime relational database applications

The Alcator C-Mod group has been using an electronic lab notebook based on a relational database since the experiment started in 1991. The software, called logbook, provides a shared lab notebook abstraction for all of the participating scientists. It currently contains more than 37 000 text entries. This application and its underlying database schema are also being used at DIIID and NSTX in the US, and installations at TCV at EPFL and H1 at ANU are in progress. A new WEB based user interface is being developed, modeled on the ENTRY_DISPLAY interface, which was written in IDL™. It provides complete read/write access to the entries table to any authorized user via a WEB browser. This interface places much lower demands on network and computing resources than the IDL/X-Windows based version.

Using Hellinger distance in a nearest neighbour classifier for relational databases

Abstract Nearest neighbour algorithms classify a previously unseen input case by finding similar cases to make predictions about the unknown features of the input case. The usefulness of the nearest neighbour algorithms has been demonstrated in many real-world domains. Unfortunately, most of the similarity measures discussed in the current nearest neighbour learning literature handle only limited data types, thus limiting their applicability to relational database applications. In this paper, we propose an enhanced nearest neighbour learning algorithm that is applicable to relational databases. The proposed method allows one to define similarity on a wide spectrum of attribute types. It automatically assigns to each attribute a weight of its importance with respect to the target attribute. The method has been implemented as a computer program and its effectiveness has been tested on four publicly available machine learning databases. Its performance is compared to another well-known machine learning method, C4.5. Our experimentation with the system demonstrates that the classification accuracy of the proposed system was superior to that of C4.5 in most cases.

CAN AN IDEAL WEB-BASED REPORTING SYSTEM FOR TRAINEE PERFORMANCE BE CREATED?

S171 INTRODUCTION: A secure, comprehensive computerized reporting system for resident evaluation has been designed and pilot-tested. It successfully addresses issues including security, ease of use, reporter bias quantification and removal [1], prompt statistical identification of trainees in need of special attention. The training program as a whole, and individual faculty are screened for gender and ethnic bias [2]. The statistical operations are all validated by multiple internal cross checks. METHODS: A secure world wide web (WWW) site has been created using the Linux operating system and UNIX relational database and web-serving applications. Multiple layers of security include name-password identification of users in addition to dual key encryption to NSA standards of all traffic on web connections to and from the system. All data is backed up two-hourly. Easy access to the system is by recent versions of popular web browsers, including Internet Explorer (Microsoft) and Navigator (Netscape), running on PC, Mac or Unix platforms. Data entry is by mouse indentification of the resident name (with picture), followed by pointing to visual analog scales for Knowledge, Judgement and Practical Skill. Written comment is required for extreme grades, but is otherwise optional. Without written comment, the entire process requires only 5 mouse clicks, and takes but seconds to complete. The pilot-test took less than 2 minutes to submit all 23 evaluations. Faculty are reminded of the requirements of the American Board of Anesthesiologists before submitting reports. Graphic and text format report generation is automated and shows individual trainees, peer comparisons, ethnic/gender comparisons, longitudinal trend studies of performance and identification of residents whose performance differs statistically significantly from their peers. Reporter bias is removed by an original statistical analysis of all reports given by all faculty [1]. The statistics and logic were ported from a desktop spreadsheet application developed with Lotus 1-2-3 (r4 and later, Lotus Development Corp). RESULTS: (Table 1)Table 1Deliberate bias towards gender and an ethnic group were inserted in one set of "faculty" reports, and was correctly detected [2]. All statistical crosschecks for arithmetic and logic performed without fault. Security was tested by an independent professional networked data systems security consultant, who continues to fail to breach the confidentiality or functionality of the system. DISCUSSION: Spreadsheet resident data analysis methods previously validated with over 3000 data points form the logical core of the new online system. It satisfies our institutional requirements for data collection and is easily modified for use with training programs at other institutions. Following successful validation of the system with dummy data, we now collect real contemporaneous data on a weekly basis. Faculty compliance is high, and user comment has been almost universally favorable to date. The project continues.

On the Formal Specification and Derivation of Relational Database Applications

The development of database applications is usually carried out informally. The derivation of database programs directly from formal specifications is a well known and unsolved problem. Most of the previous work on the area either tried to solve the problem too generally or was restricted to some trivial aspects, for example deriving the database structure and/or simple operations. However difficult in general, deriving relational database applications directly from Z specifications satisfying a certain set of rules (the method) is not arduous. With appropriate tool support, writing formal specifications according to the method and deriving the corresponding relational database programs can be straightforward. Moreover, it should produce code which is standardized and thus easier to understand and maintain.This paper summarizes material from my Ph.D. thesis [4]. Therefore, it is a pleasure to thank again my supervisors, Ray Welland and David Harper. The financial support for the Ph.D. course was provided by CAPES (Brazilian Federal Agency for Postgraduate Education) and by UFPE (Federal University of Pernambuco).

Generic fuzzy reasoning nets as a basis for reverse engineering relational database applications

Generic fuzzy reasoning nets as a basis for reverse engineering relational database applications

SQLGEN: A framework for rapid client-server database application development

SQLGEN is a framework for rapid client-server relational database application development. It relies on an active data dictionary on the client machine that stores metadata on one or more database servers to which the client may be connected. The dictionary generates dynamic Structured Query Language (SQL) to perform common database operations; it also stores information about the access rights of the user at log-in time, which is used to partially self-configure the behavior of the client to disable inappropriate user actions. SQLGEN uses a microcomputer database as the client to store metadata in relational form, to transiently capture server data in tables, and to allow rapid application prototyping followed by porting to client-server mode with modest effort. SQLGEN is currently used in several production biomedical databases.

SQLGEN: A framework for rapid client-server database application development

SQLGEN is a framework for rapid client-server relational database application development. It relies on an active data dictionary on the client machine that stores metadata on one or more database servers to which the client may be connected. The dictionary generates dynamic Structured Query Language (SQL) to perform common database operations; it also stores information about the access rights of the user at log-in time, which is used to partially self-configure the behavior of the client to disable inappropriate user actions. SQLGEN uses a microcomputer database as the client to store metadata in relational form, to transiently capture server data in tables, and to allow rapid application prototyping followed by porting to client-server mode with modest effort. SQLGEN is currently used in several production biomedical databases.

A line balancing heuristic case study for existing automated surface mount assembly line setups

The industry of manufacturing printed circuit boards (PCB) is experiencing rapid technological change that has increased the logistical complexity of process planning. In particular, the task of allocating components to machines in order to balance the assembly line has become nearly impossible for the individual process planner to perform manually. As a result, the placement times for machines on automated PCB assembly lines are often unbalanced. This paper presents an overview of a heuristic based decision tool used by the process planner that will balance the line, while making tradeoffs between the savings incurred from a better balanced line and the associated relocation costs. The input required by this heuristic is a current feasible product group setup and an accurate characterization of each of the assembly machines. A relational database application and spreadsheet were designed and are used to execute each heuristic iteration. An accompanying industrial case study and results are provided.

Using an object-oriented approach to the development of a relational database application system

Object-oriented technology has been proposed in recent years as a promising approach to increasing programmer productivity and the quality of software development. The traditional development of a database application system distinctively separates a system's behavior and its data by using entity-relationship diagrams, functional decomposition, and process-dependency diagrams. The object-oriented approach, on the other hand, integrates both data and behavior, and this can result in a merging of both software and databases. To gain more insight into the object-oriented approach to the analysis and design of software development, we applied this approach to the development of a simplified hospital administration system. The resulting application system is an object-based system but uses a relational database manager. This illustrates the fact that object-oriented approaches are not limited to object-oriented systems or databases: they can, in fact, be used for more traditional design. This technique may allow easier transition from data-based to object-based systems. Software that is reusable, improved in its design, more reliable, and simpler in its programming and maintenance requirements would truly be an advantage to users and developers alike.

Enterprise Objects Framework

Today's information system executives desperately need to improve programmer productivity and reduce software maintenance costs. They are demanding flexibility in frameworks and architectures in order to meet unforeseen changes (see [Yankee 94] ). Adaptability is a major requirement of most company's information systems efforts. Management of change is one of the key computing concepts of the 1990s.Object-oriented tools and development frameworks are starting to deliver the benefits of increased productivity and flexibility. These next-generation products now need to be combined with relational databases to leverage investments and facilitate access to business data. Object-Relational Enablers automate the process of storing complex objects in a relational database management system (see [Aberdeen 94] ).The Enterprise Objects Framework product is a second generation product bringing the benefits of object-oriented programming to relational database application development. Enterprise Objects Framework enables developers to construct reusable business objects that combine business logic with persistent storage in industry-standard relational databases. Enterprise objects are first class citizens in the NEXTSTEP and OpenStep developer and user environments. They can be geographically distributed throughout heterogeneous servers within an enterprise using the Portable Distributed Objects product (see [NeXT-DO 94] ).In this extended abstract we first describe the enterprise object distribution model and then give a brief synopsis of how relational data is mapped into objects. We then present an outline of the system architecture, explain how objects are mapped to multiple tables, and summarize the transaction semantics as well as the application development life-cycle. We conclude with an outlook on future development.

Monitoring and modelling tools for high performance database systems

We have produced a suite of software tools which has proved to be highly valuable in the porting of large, complex relational database applications from conventional to parallel systems. These tools are being continually developed to extend their functionality and genericity over a range of platforms, and provide a basis for the design, implementation, optimisation and management of any parallel database system. A considerable amount of the development has been performed using a Meiko Relational DataCache — a multi-spare, multi-transputer ORACLE system. In this paper we present a summary of our activities, beginning with a brief description of the Meiko system (as currently configured), followed by a more detailed account of some of the tools, and finishing with some general comments on future work.

Formal query languages for secure relational databases

The addition of stringent security specifications to the list of requirements for an application poses many new problems in DBMS design and implementation, as well as database design, use, and maintenance. Tight security requirements, such as those that result in silent masking of witholding of true information from a user or the introduction of false information into query answers, also raise fundamental questions about the meaning of the database and the semantics of accompanying query languages. In this paper, we propose a belief-based semantics for secure databases, which provides a semantics for databases that can “lie” about the state of the world, or about their knowledge about the state of the world, in order to preserve security. This kind of semantics can be used as a helpful retrofit for the proposals for a “multilevel secure” database model (a particularly stringent form of security), and may be useful for less restrictive security policies as well. We also propose a family of query languages for multilevel secure relational database applications, and base the semantics of those languages on our semantics for secure databases. Our query languages are free of the semantic problems associated with use of ordinary SQL in a multilevel secure context, and should be easy for users to understand and employ.

Towards an efficient evaluation of recursive aggregates in deductive databases

This paper is devoted to the evaluation of aggregates (avg, sum,…) in deductive databases. Aggregates have proved to be a necessary modeling tool for a wide range of applications in non-deductive relational databases. They also appear to be important in connection with recursive rules, as shown by thebill of materials example. Several recent papers have studied the problem of semantics for aggregate programs. As in these papers, we distinguish between the classes of stratified (non-recursive) and recursive aggregate programs. For each of these two classes, the declarative semantics is recalled and an efficient evaluation algorithm is presented. The semantics and computation of aggregate programs in the recursive case are more complex: we rely on the notion of graph traversal to motivate the semantics and the evaluation method proposed. The algorithms presented here are integrated in the QSQ framework. Our work extends the recent work on aggregates by proposing an efficient algorithm in the recursive case. Recursive aggregates have been implemented in the EKS-V1 system.

Implementing a relational database for an accelerated-life-test facility

This paper describes the design of a relational database and associated command structure for an accelerated-life-test facility. The primary goals of the design were to: (1) improve data integrity, and (2) provide a complete and consistent historical record of reliability test results. The intended reader is the engineer who wants to understand the issues involved in automating the reliability-data collection and reporting process. The paper: (1) shows (via the story of a particular reliability database design) in a tutorial fashion how to use system requirements and the formalisms of the relational model to create a database system for engineering tests; and (2) serves as a guide for developing relational database applications for other engineering and production activities. The paper makes three primary contributions by showing: (a) a practical method for constructing a relational database. The method is based on an IDEFO representation of the testing process, which is easier for the database novice to understand and implement than the usual approaches of data flow or entity-relationship diagrams. (b) The value of a particular database structure for maintaining engineering test database integrity: a table for test measurements, a table for kinds of test measurements, and a table for test measurement procedures. (c) How to write data entry/reporting application programs that maintain data integrity and ease the user's input burden. While specific issues in reliability testing are discussed, the methodology to construct the database and user interface applies broadly. >

OR vice: Forecasting and classification techniques for narcotics interdiction

Counternarcotics interdiction efforts have traditionally relied on historically determined sorting criteria or “best guess” to find and classify suspected smuggling traffic. We present a more quantitative approach which incorporates customized database applications, graphics software and statistical modeling techniques to develop forecasting and classification models. Preliminary results show that statistical methodology can improve interdiction rates and reduce forecast error. The idea of predictive modeling is thus gaining support in the counterdrug community. The problem is divided into sea, air and land forecasting, only part of which will be addressed here. The maritime problem is solved using multiple regression in lieu of multivariate time series. This model predicts illegal boat counts by behavior and geographic region. We developed support software to present the forecasts and to automate the process of performing periodic model updates. During the period, the model was in use at. Coast Guard Headquarters. Because of deterrence provided by improved intervention, the vessel seizure rate declined from 1 every 36 hours to 1 every 6 months. Due in part to the success of the sea model, the maritime movement of marijuana has ceased to be a major threat. The air problem is more complex, and required us to locally design data collection and display software. Intelligence analysts are using a customized relational database application with a map overlay to perform visual pattern recognition of smuggling routes. We are solving the modeling portion of the air problem using multiple regression for regional forecasts of traffic density, and discriminant analysis to develop tactical models that classify “good guys” and “bad guys”. The air models are still under development, but we discuss some modeling considerations and preliminary results. The land problem is even more difficult, and data collection is still in progress.