A Comparison of the Temporal Expressiveness of Three Database Query Methods

From Tetherless World Wiki

Jump to: navigation, search

Citation: Amar K. Das and Mark A. Musen. (1995) A Comparison of the Temporal Expressiveness of Three Database Query Methods. In , 1995.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Amar K. Das and Mark A. Musen
title A Comparison of the Temporal Expressiveness of Three Database Query Methods
number KSL-95-61
institution Knowledge Systems, AI Laboratory
address New Orleans, LA
year 1995
Bibtex more
note Updated August 1995. Proceedings of the Nineteenth Annual Symposium on Computer Applications in Medical Care Washington D. C., November 1995.
Access Paper
abstract Time is a multifaceted phenomenon that developers of clinical decision-support systems can model at various levels of complexity. An unresolved issue for the design of clinical databases is whether the underlying data model should support interval semantics. In this paper, we examine whether interval-based operations are required for querying protocol-based conditions. We report on an analysis of a set of 256 eligibility criteria that the T-HELPER system uses to screen patients for enrollment in eight clinical-trial protocols for HIV disease. We consider three data-manipulation methods for temporal querying: the consensus query representation Arden Syntax, the commercial standard query language SQL, and the temporal query language TimeLineSQL (TLSQL). We compare the ability of these three query methods to express the eligibility criteria. Seventy nine percent of the 256 criteria require operations on time stamps. These temporal conditions comprise four distinct patterns, two of which use interval-based data. Our analysis indicates that the Arden Syntax can query the two non-interval patterns, which represent 54% of the temporal conditions. Timepoint comparisons formulated in SQL can instantiate the two non-interval patterns and one interval pattern, which encompass 96% of the temporal conditions. TLSQL, which supports an interval-based model of time, can express all four types of temporal patterns. Our results demonstrate that the T-HELPER system requires simple temporal operations for most protocol-based queries. Of the three approaches tested, TLSQL is the only query method that is sufficiently expressive for the temporal conditions in this system.

KSL Technical Report ID: KSL-95-61
Facts about A Comparison of the Temporal Expressiveness of Three Database Query MethodsRDF feed
Abstract Time is a multifaceted phenomenon that dev … Time is a multifaceted phenomenon that developers of clinical decision-support systems can model at various levels of complexity. An unresolved issue for the design of clinical databases is whether the underlying data model should support interval semantics. In this paper, we examine whether interval-based operations are required for querying protocol-based conditions. We report on an analysis of a set of 256 eligibility criteria that the T-HELPER system uses to screen patients for enrollment in eight clinical-trial protocols for HIV disease. We consider three data-manipulation methods for temporal querying: the consensus query representation Arden Syntax, the commercial standard query language SQL, and the temporal query language TimeLineSQL (TLSQL). We compare the ability of these three query methods to express the eligibility criteria. Seventy nine percent of the 256 criteria require operations on time stamps. These temporal conditions comprise four distinct patterns, two of which use interval-based data. Our analysis indicates that the Arden Syntax can query the two non-interval patterns, which represent 54% of the temporal conditions. Timepoint comparisons formulated in SQL can instantiate the two non-interval patterns and one interval pattern, which encompass 96% of the temporal conditions. TLSQL, which supports an interval-based model of time, can express all four types of temporal patterns. Our results demonstrate that the T-HELPER system requires simple temporal operations for most protocol-based queries. Of the three approaches tested, TLSQL is the only query method that is sufficiently expressive for the temporal conditions in this system. or the temporal conditions in this system.
Address New Orleans, LA  +
Author Amar K. Das and Mark A. Musen  +
Bibtype techreport  +
Has author Amar K. Das and Mark A. Musen  +
Has identifier KSL-95-61  +
Has publishing details 1995  +
Has title A Comparison of the Temporal Expressiveness of Three Database Query Methods  +
Has year 1995  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-95-61  +
Note Updated August 1995. Proceedings of the Nineteenth Annual Symposium on Computer Applications in Medical Care Washington D. C., November 1995.  +
Number KSL-95-61  +
Process note GOOGLE  +
Title A Comparison of the Temporal Expressiveness of Three Database Query Methods  +
Year 1995  +
Retrieved from "http://tw.rpi.edu/wiki/A_Comparison_of_the_Temporal_Expressiveness_of_Three_Database_Query_Methods"
Personal tools